Four fundamental parameters of a code and their combinatorial significance
- 1 December 1973
- journal article
- Published by Elsevier in Information and Control
- Vol. 23 (5) , 407-438
- https://doi.org/10.1016/s0019-9958(73)80007-5
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Nearly perfect binary codesDiscrete Mathematics, 1972
- A class of low-rate nonlinear binary codesInformation and Control, 1972
- Two theorems on perfect codesDiscrete Mathematics, 1972
- On the nonexistence of perfect 2- and 3-hamming-error-correcting codes over GF(q)Information and Control, 1970
- On the uniqueness of the Golay codesJournal of Combinatorial Theory, 1968
- A class of optimum nonlinear double-error-correcting codesInformation and Control, 1968
- Maximum distanceq-nary codesIEEE Transactions on Information Theory, 1964
- Power moment identities on weight distributions in error correcting codesInformation and Control, 1963
- On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced DesignsThe Annals of Mathematical Statistics, 1959
- Orthogonal Arrays of Strength two and threeThe Annals of Mathematical Statistics, 1952