Name
Title | ||
|---|---|---|
Constructing rate 1/p systematic binary quasi-cyclic codes based on the matroid theory |
Abstract | ||
|---|---|---|
In this paper, rate 1/p binary systematic quasi-cyclic (QC) codes are constructed based on Matroid Theory (MT). The relationship between the generator matrix and minimum distance d is derived through MT, which is benefit to find numbers of QC codes with large minimum distance by our Matroid search algorithm. More than seventy of QC codes that extend previously published results are presented. Among these codes, there are nine codes whose minimum distance is larger than those of the known codes found by Gulliver et al. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s10623-012-9715-1 | Des. Codes Cryptography |
Keywords | Field | DocType |
Matroid theory,Binary quasi-cyclic codes,Minimum distance,Matroid search algorithm,94B05 | Matroid,Discrete mathematics,Hamming code,Combinatorics,Block code,Expander code,Matroid partitioning,Linear code,Graphic matroid,Weighted matroid,Mathematics | Journal |
Volume | Issue | ISSN |
71 | 1 | 0925-1022 |
Citations | PageRank | References |
1 | 0.36 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guangfu Wu | 1 | 1 | 1.04 |
| Hsin-Chiu Chang | 2 | 33 | 7.58 |
| Lin Wang | 3 | 155 | 15.90 |
| T. K. Truong | 4 | 1 | 0.36 |