✦ LIBER ✦

On complete regularity of extended codes

✍ Scribed by A.E. Brouwer

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 158 KB
Volume: 117
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90342-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Completely regular codes

✍ Arnold Neumaier 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 404 KB

Neumaier, A., Completely regular codes, Discrete Mathematics 106/107 (1992) 353-360 Completely regular codes are a large class of codes which share many of the most interesting properties of perfect codes. This paper shows that the basic theory-including Lloyd's theorem+an be obtained very elegantly

Completely regular codes and completely

Completely regular codes and completely transitive codes

✍ Patrick Solé 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 511 KB

A binary code C is said to be completely regular if the weight distribution of any translate x + C depends only on the distance of x to C. Such codes are related to designs and distance regular graphs. Their covering radius is equal to their external distance. All perfect and uniformly packed codes

A note on completely regular codes

✍ A.E. Brouwer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 169 KB

We show that puncturing a completely regular even binary code produces a completely regular code again, thus answering a question posed in Brouwer et al. [3], p. 357.

Dual distances of completely regular cod

Dual distances of completely regular codes

✍ B. Courteau; A. Montpetit 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Courteau, B. and A. Montpetit, Dual distances of completely regular codes, Discrete Mathematics 89 (1991) 7-15. In this paper we prove two theorems giving arithmetical constraints on the possible values of dual distances of completely regular codes extending some recent results of Calderbank and Gce

On the Extendability of Linear Codes

✍ Tatsuya Maruta 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 237 KB

Symposium on Inform. Theory, Whistler, Canada,'' pp. 345) proved that every [n, k, d] O code with gcd(d, q)"1 and with all weights congruent to 0 or d (modulo q) is extendable to an O code with all weights congruent to 0 or d#1 (modulo q). We give another elementary geometrical proof of this theor

On the Cyclicity of Goppa Codes, Parity-

On the Cyclicity of Goppa Codes, Parity-Check Subcodes of Goppa Codes, and Extended Goppa Codes

✍ Thierry P. Berger 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 231 KB

Classical Goppa codes are a special case of Alternant codes. First we prove that the parity-check subcodes of Goppa codes and the extended Goppa codes are both Alternant codes. Before this paper, all known cyclic Goppa codes were some particular BCH codes. Many families of Goppa codes with a cyclic