Nine good rate (m-1)/pm quasi-cyclic codes

TitleNine good rate (m-1)/pm quasi-cyclic codes
Publication TypeJournal Article
Year of Publication1992
AuthorsGulliver, T. A., and V. K. Bhargava
JournalInformation Theory, IEEE Transactions on
Pagination1366 -1369
Date Publishedjul.
Keywords1-generator QC codes, binary linear codes, error correction codes, heuristic combinatorial optimization, lower bounds, minimum distance, optimisation, quasi-cyclic codes, rate (m-1)/pm codes

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


a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia