DocumentCode
885710
Title
Nine good rate (m -1)/pm quasi-cyclic codes
Author
Gulliver, T. Aaron ; Bhargava, Vijay K.
Author_Institution
Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
Volume
38
Issue
4
fYear
1992
fDate
7/1/1992 12:00:00 AM
Firstpage
1366
Lastpage
1369
Abstract
The class of quasi-cyclic (QC) codes has been proven to contain many good codes. To date the known results are largely codes of the form 1/p and (p -1)/p constructed from circulant matrices. A generalization of these rate 1/p codes to rate (m -1)/pm codes based on the theory of 1-generator QC codes is presented. The results of a search for good codes based on heuristic combinatorial optimization are nine codes which improve the known lower bounds on the minimum distance of binary linear codes
Keywords
error correction codes; optimisation; 1-generator QC codes; binary linear codes; heuristic combinatorial optimization; lower bounds; minimum distance; quasi-cyclic codes; rate (m-1)/pm codes; Convolutional codes; Encyclopedias; Equations; Error correction; Galois fields; Polynomials;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.144718
Filename
144718
Link To Document