✦ LIBER ✦

An updated table of rate 1p binary quasi-cyclic codes

✍ Scribed by T.A. Gulliver; V.K. Bhargava

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 275 KB
Volume: 8
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(95)00071-w

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, an updated table of maximum minimum distances for rate 1/p binary quasi-cyclic (QC) codes is presented. Many of the new codes given attain the bounds in the table by Brouwer and Verhoeff and the expanded table maintained by Brouwer, and fourteen of these codes improve the bounds. The generator polynomials of the new QC codes which provide table improvements are given. These codes were found using integer linear programming and a heuristic combinatorial optimization algorithm.

📜 SIMILAR VOLUMES

An updated table of binary/ternary mixed

An updated table of binary/ternary mixed covering codes

✍ Riccardo Bertolo; Patric R. J. Östergård; William D. Weakley 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract An updated table of __K__~2,3~(__b__,__t__;__R__)—the minimum cardinality of a code with __b__ binary coordinates, __t__ ternary coordinates, and covering radius __R__—is presented for __b__ + __t__ ≤ 13, __R__ ≤ 3. The results include new explanations of short binary and ternary coveri

Burst error correcting binary cyclic an

Burst error correcting binary cyclic an codes consisting of 2m - 1 codewords

✍ Ryutaro Murakami; Yoshiteru Okura; Ryosaku Shimada 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 566 KB