Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)

TitleSome best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
Publication TypeJournal Article
Year of Publication1992
AuthorsGulliver, T. A., and V. K. Bhargava
JournalInformation Theory, IEEE Transactions on
Pagination1369 -1374
Date Publishedjul.
Keywordserror correction codes, GF(3), GF(4), heuristic combinatorial optimization, integer linear programming, integer programming, linear code, linear programming, maximum known distances, minimum distance, nonbinary quadratic residue codes, optimisation, power residue codes, rate (p-1)/p binary codes, rate 1/p binary codes, search algorithm, systematic quasi-cyclic codes

The class of quasi-cyclic (QC) codes has been proven to contain many good codes. To date the known QC codes are primarily rate 1/p and (p-1)/p binary codes constructed from circulant matrices. These results are extended to QC codes over GF(3) and GF(4). Codes are constructed using integer linear programming and heuristic combinatorial optimization. Many of these attain the maximum possible minimum distance for any linear code with the same parameters, and several improve the maximum known distances. The link between power residue (PR) codes and QC codes is exploited as a means of constructing new QC codes and to initialize the search algorithm. Previously unknown minimum distances for nonbinary quadratic residue codes are given. The minimum distances for the PR codes and the maximum known distances for the QC codes are tabulated


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