Title :
A bound for cyclic codes of composite length (Corresp.)
Author :
Hartmann, C. P R ; Tzeng, K.K.
fDate :
3/1/1972 12:00:00 AM
Abstract :
An upper bound on the minimum distance of cyclic codes of composite length is presented. This upper bound proves the BCH bound to be exact for many cyclic codes.
Keywords :
Cyclic codes; Information science; Polynomials; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1972.1054783
