Name
Abstract | ||
|---|---|---|
The van Lint-Wilson AB-method yields a short proof of the Roos bound for the minimum distance of a cyclic code. We use the AB-method to obtain a different bound for the weights of a linear code. In contrast to the Roos bound, the role of the codes A and B in our bound is symmetric. We use the bound to prove the actual minimum distance for a class of dual BCH codes of length q2 - 1 over Fq. We give cyclic codes [63, 38, 16] and [65, 40, 16] over F8 that are better than the known [63, 38, 15] and [65, 40, 15] codes. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.jcta.2006.03.020 | J. Comb. Theory, Ser. A |
Keywords | Field | DocType |
minimum distance,van lint-wilson ab-method,dual bch code,minimum distance bound,short proof,linear code,roos bound,length q2,actual minimum distance,cyclic code,bch code | Discrete mathematics,Hamming code,Concatenated error correction code,Combinatorics,Low-density parity-check code,Polynomial code,Cyclic code,Reed–Solomon error correction,Linear code,Hamming bound,Mathematics | Journal |
Volume | Issue | ISSN |
113 | 8 | Journal of Combinatorial Theory, Series A |
Citations | PageRank | References |
9 | 0.77 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Iwan M. Duursma | 1 | 279 | 26.85 |
| Ruud Pellikaan | 2 | 116 | 15.78 |