On the minimum distance of certain reversible cyclic codes (Corresp.)
- 1 September 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 16 (5) , 644-646
- https://doi.org/10.1109/tit.1970.1054517
Abstract
The minimum distance of a class of reversible cyclic codes has been proved to be greater than that given by the BCH bound. It is also noted that this class of codes includes the class of primitive double-error-correcting binary codes of Melas as well as the class of nonprimitive double-error-correcting binary codes discovered by Zetterberg as special cases.Keywords
This publication has 4 references indexed in Scilit:
- Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codesIEEE Transactions on Information Theory, 1969
- Reversible codesInformation and Control, 1964
- Cyclic codes from irreducible polynomials for correction of multiple errorsIEEE Transactions on Information Theory, 1962
- A Cyclic Code for Double Error Correction [Letter to the Editor]IBM Journal of Research and Development, 1960