✦ LIBER ✦

New Codes via the Lengthening of BCH Codes with UEP Codes

✍ Scribed by Jürgen Bierbrauer; Yves Edel; Ludo Tolhuizen

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 118 KB
Volume: 5
Category: Article
ISSN: 1071-5797
DOI: 10.1006/ffta.1999.0245

No coin nor oath required. For personal study only.

✦ Synopsis

We describe a code lengthening technique that uses unequal error protection codes as su$x codes and combine it with iteration of the conventional Construction X. By applying this technique to BCH codes, we obtain "ve new binary codes, 13 new ternary codes, and 13 new quarternary codes. An improvement of Construction XX yields two new ternary codes.

📜 SIMILAR VOLUMES

On the covering radius of long binary BC

On the covering radius of long binary BCH codes

✍ A Tietäinen 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 98 KB

Bar codes with special correlations like

Bar codes with special correlations like those of the Barker codes

✍ Yajun Li 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 304 KB

A generalization of the BCH bound for cy

A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound

✍ C Roos 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Bounds on the minimum distance of the du

Bounds on the minimum distance of the duals of extended BCH codes over(mathbb{F}_p )

✍ Françoise Levy-dit-Vehel 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 738 KB

A sharpening of the Johnson bound for bi

A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parameters

✍ A. E. Brouwer; L. M. G. M. Tolhuizen 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 163 KB

New Bounds on the Distance Distribution

New Bounds on the Distance Distribution of Extended Goppa Codes

✍ Simon Litsyn; Sarit Zur 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 169 KB

We derive new estimates for the error term in the binomial approximation to the distance distribution of extended Goppa codes. This is an improvement on the earlier bounds by Vladuts and Skorobogatov, and Levy and Litsyn.