Title :
On a (145, 32) binary cyclic code
Author_Institution :
IBM Corp., Poughkeepsie, NY, USA
fDate :
11/1/1999 12:00:00 AM
Abstract :
We discovered that a (145, 32) binary cyclic code generated by the product of an irreducible polynomial of degree 28 with exponent 145 and the polynomial x4+x3+x2+x+1 has a minimum distance of 44
Keywords :
binary codes; cyclic codes; polynomials; (145, 32) binary cyclic code; irreducible polynomial; minimum distance; Conferences; Cryptography; Linear code; Notice of Violation; World Wide Web; Writing;
Journal_Title :
Information Theory, IEEE Transactions on
