A Random Local Matroid Search Algorithm to Construct Good Rate 1/p Systematic Binary Quasi-Cyclic Codes

In this letter, a random local matroid search algorithm is proposed to construct good rate 1/p systematic QC codes based on the relationship between the generator matrix and the minimum distance when the length of the information vector is k ≥ 15 . More than twenty new QC codes are obtained and thei...

Full description

Saved in:
Bibliographic Details
Published inIEEE communications letters Vol. 19; no. 5; pp. 699 - 702
Main Authors Wu, Guangfu, Li, Yong, Zhang, Shuiping, He, Jiguang
Format Journal Article
LanguageEnglish
Published IEEE 01.05.2015
Subjects
Binary quasi-cyclic codes
Binary systems
Construction
Generators
Linear codes
Mathematical analysis
Matroid theory
Minimum distance
Quality control
Random local matroid search algorithm
Search algorithms
Systematics
Vectors
Vectors (mathematics)
Welding
random local matroid search algorithm
matroid theory
minimum distance
Binary quasi-cyclic codes
Online AccessGet full text
ISSN1089-7798
DOI10.1109/LCOMM.2015.2401572

Cover

More Information
Summary:In this letter, a random local matroid search algorithm is proposed to construct good rate 1/p systematic QC codes based on the relationship between the generator matrix and the minimum distance when the length of the information vector is k ≥ 15 . More than twenty new QC codes are obtained and their corresponding generator matrices are revealed, which extends previous results. Nine of these new codes have larger minimum distances than the reported ones in the previous literature.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1089-7798
DOI:10.1109/LCOMM.2015.2401572