Title :
New results on binary quasi-cyclic codes
Author_Institution :
Sch. of Eng., Kristianstad Univ., Sweden
Abstract :
Twelve new binary quasi-cyclic codes, which improve the lower bounds on minimum distances for binary linear codes, are presented, and a Web database on best-known binary quasi-cyclic codes is constructed for public access
Keywords :
binary codes; cyclic codes; linear codes; polynomials; Web database; binary linear codes; binary quasi-cyclic codes; generator polynomials; lower bounds; minimum distance; public access; Binary codes; Data engineering; Databases; HTML; Linear code; Polynomials; Upper bound; World Wide Web;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866495
