✦ LIBER ✦

On lengthening of covering codes

✍ Scribed by Iiro Honkala

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 278 KB
Volume: 106-107
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90556-u

No coin nor oath required. For personal study only.

✦ Synopsis

Honkala, I., On lengthening of covering codes, Discrete Mathematics 106/107 (1992) 291-295.

We study a construction method introduced by Kamps and van Lint and generalized by Blokhuis and Lam, and van Lint jr and show how the theorem of Cauchy and Davenport and other related results about finite fields can be used in the lengthening of covering codes over prime power alphabets.

📜 SIMILAR VOLUMES

New Codes via the Lengthening of BCH Cod

New Codes via the Lengthening of BCH Codes with UEP Codes

✍ Jürgen Bierbrauer; Yves Edel; Ludo Tolhuizen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 118 KB

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 improvemen

On the normality of multiple covering co

On the normality of multiple covering codes

✍ Iiro Honkala 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 778 KB

A binary code C of length n is called a p-fold r-covering if every binary word of length n is within Hamming distance r of at least p codewords of C. The normality and the amalgamated direct sum (ADS) construction of l-fold coverings have been extensively studied. In this paper we generalize the con

On the covering radius of cyclic linear

On the covering radius of cyclic linear codes and arithmetic codes

✍ Tor Helleseth 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 781 KB

The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is shown to be related to Waring's problem i n a finite field and to the theory of cyclotomic numbers. The methods devel oped l ead to new results for the covering radius of certain f-errorcorrecting BC

Classification of binary covering codes

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

On covering sets and error-correcting co

On covering sets and error-correcting codes

✍ J.G Kalbfleisch; R.G Stanton; J.D Horton 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 811 KB

On the covering radius of Reed—Solomon c

On the covering radius of Reed—Solomon codes

✍ Arne Dür 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 354 KB