More on the minimum distance of cyclic codes
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (1) , 187-189
- https://doi.org/10.1109/18.61137
Abstract
It was recently shown that the so-called Jensen bound is generally weaker than the product method and the shifting method introduced by van Lint and Wilson (1986). It is shown that the minimum distance of the two cyclic codes of length 65 (for which it is known that the product method does not produce the desired result) can be proved using Jensen's method (1985) with some adaptationsKeywords
This publication has 3 references indexed in Scilit:
- On the minimum distance of cyclic codesIEEE Transactions on Information Theory, 1986
- The concatenated structure of cyclic and Abelian codesIEEE Transactions on Information Theory, 1985
- Some long cyclic linear binary codes are not so badIEEE Transactions on Information Theory, 1974