An upper bound onk/nfor affine-invariant codes with fixedd/n(Corresp.)

Tadao Kasami

IEEE Transactions on Information Theory · 1969 · 20 citations · 6 references

Concepts

Abstract

An upper bound on the transmission ratio <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k/n</tex> for binary cyclic codes whose extended codes are invariant under the affine group of permutations, is presented. As a consequence, the transmission ratio <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k/n</tex> of any affine-invariant code with a fixed <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</tex> (minimum weight)/ <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</tex> 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.

References

6