Title :
Twelve good rate (m-r)/pm quasi-cyclic codes
Author :
Gulliver, T. Aaron ; Bhargava, Vijay K.
Author_Institution :
Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
fDate :
9/1/1993 12:00:00 AM
Abstract :
Twelve new quasi-cyclic (QC) codes are presented which improve the bounds on the best known binary linear codes. They are rate (m-r)/pm, r>1, codes constructed by deleting r rows from the circulant matrices of rate m/pm QC codes, based on the factors of xm-1. Heuristic combinatorial optimization was used to find these codes
Keywords :
cyclic codes; matrix algebra; optimisation; binary linear codes; bounds; circulant matrices; heuristic combinatorial optimization; quasicyclic codes; Linear code; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
