An upper bound onk/nfor affine-invariant codes with fixedd/n(Corresp.)
- 1 January 1969
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 15 (1) , 174-176
- https://doi.org/10.1109/tit.1969.1054254
Abstract
An upper bound on the transmission ratiok/nfor binary cyclic codes whose extended codes are invariant under the affine group of permutations, is presented. As a consequence, the transmission ratiok/nof any affine-invariant code with a fixedd(minimum weight)/nis shown to approach zero as the code length n increases. This is an extension of the Lin and Weldon result for primitive BCH codes.Keywords
This publication has 5 references indexed in Scilit:
- Polynomial codesIEEE Transactions on Information Theory, 1968
- Some results on cyclic codes which are invariant under the affine group and their applicationsInformation and Control, 1967
- Long BCH codes are badInformation and Control, 1967
- Cyclic product codesIEEE Transactions on Information Theory, 1965
- THRESHOLD DECODINGPublished by Defense Technical Information Center (DTIC) ,1963