Nine good rate (m-1)/pm quasi-cyclic codes
- 1 July 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 38 (4) , 1366-1369
- https://doi.org/10.1109/18.144718
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 codesKeywords
This publication has 6 references indexed in Scilit:
- Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)IEEE Transactions on Information Theory, 1992
- Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codesIEEE Transactions on Information Theory, 1991
- Integer and Combinatorial OptimizationPublished by Wiley ,1988
- An updated table of minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1987
- Using simulated annealing to design good codesIEEE Transactions on Information Theory, 1987
- On quasi-cyclic codes with rate l m (Corresp.)IEEE Transactions on Information Theory, 1978