Title :
Generalized cyclotomic codes of length p1e(1)...pte(t)
Author :
Ding, Cunsheng ; Helleseth, Tor
Author_Institution :
Dept. of Comput. Sci., Nat. Univ. of Singapore, Singapore
fDate :
3/1/1999 12:00:00 AM
Abstract :
We first introduce a generalized cyclotomy of order 2 with respect to p1e(1)...pte(t). We then present two classes of new error-correcting binary cyclic codes of length p1e(1)...pte(t) based on this generalized cyclotomy. We prove either a square-root bound or a similar bound on the minimum odd weight of those codes with length n=p 1e(1) p2e(2)
Keywords :
binary codes; cyclic codes; error correction codes; polynomials; code length; code weight; error-correcting binary cyclic codes; generalized cyclotimic codes; minimum odd weight; polynomials; square-root bound; Computer science; Cryptography; Error correction codes; Gaussian processes; Informatics; Linear code;
Journal_Title :
Information Theory, IEEE Transactions on
