DocumentCode :
911746
Title :
An upper bound on 
for affine-invariant codes with fixed 
(Corresp.)
for affine-invariant codes with fixed (Corresp.)Author :
Kasami, T.
Volume :
15
Issue :
1
fYear :
1969
fDate :
1/1/1969 12:00:00 AM
Firstpage :
174
Lastpage :
176
Abstract :
An upper bound on the transmission ratio for binary cyclic codes whose extended codes are invariant under the affine group of permutations, is presented. As a consequence, the transmission ratio of any affine-invariant code with a fixed 
(minimum weight)/ 
is shown to approach zero as the code length n increases. This is an extension of the Lin and Weldon result for primitive BCH codes.
for binary cyclic codes whose extended codes are invariant under the affine group of permutations, is presented. As a consequence, the transmission ratio of any affine-invariant code with a fixed (minimum weight)/ is 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 :
Cyclic codes; Permutation codes; Laboratories; Parity check codes; Polynomials; TV; Telegraphy; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1969.1054254
Filename :
1054254
Link To Document :
