DocumentCode
2445024
Title
On quasi-cyclic codes
Author
Heijnen, Petra ; Van Tilborg, Henk ; Weijs, Sander
Author_Institution
Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands
fYear
1998
fDate
16-21 Aug 1998
Firstpage
65
Abstract
Many binary quasi-cyclic codes have a better minimum distance than other known linear codes with the same parameters. We present 43 new quasi-cyclic codes, which improve on the parameters of previously found quasi-cyclic codes. Five of them even improve the lower bound on the minimum distance for linear codes. Furthermore we present a decoding algorithm for the binary quasi-cyclic codes of rate 1/m
Keywords
binary codes; cyclic codes; decoding; linear codes; binary quasi-cyclic codes; code parameters; code rate; decoding algorithm; linear codes; lower bound; minimum distance; Decoding; Equations; Linear code; Mathematics; Parity check codes; Polynomials; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708648
Filename
708648
Link To Document