Electrical and Computer Engineering
2332 Main Mall
Vancouver,
BC
Canada
V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:
info@ece.ubc.ca
| Title | Nine good rate (m-1)/pm quasi-cyclic codes |
| Publication Type | Journal Article |
| Year of Publication | 1992 |
| Authors | Gulliver, T. A., and V. K. Bhargava |
| Journal | Information Theory, IEEE Transactions on |
| Volume | 38 |
| Pagination | 1366 -1369 |
| Date Published | jul. |
| ISSN | 0018-9448 |
| Keywords | 1-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 |
| 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 |
| URL | http://dx.doi.org/10.1109/18.144718 |
| DOI | 10.1109/18.144718 |