✦ LIBER ✦

On the Extendability of Linear Codes

✍ Scribed by Tatsuya Maruta

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 237 KB
Volume: 7
Category: Article
ISSN: 1071-5797
DOI: 10.1006/ffta.2001.0296

No coin nor oath required. For personal study only.

✦ Synopsis

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 theorem, which also yields the uniqueness of the extension.

📜 SIMILAR VOLUMES

On the reconstruction of linear codes

✍ Philip Maynard; Johannes Siemons 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 2 views

For a linear code over GF (q) we consider two kinds of ''subcodes'' called residuals and punctures. When does the collection of residuals or punctures determine the isomorphism class of the code? We call such a code residually or puncture reconstructible. We investigate these notions of reconstructi

On complete regularity of extended codes

✍ A.E. Brouwer 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 158 KB

On computing the minimum distance of lin

On computing the minimum distance of linear codes

✍ Masami Mohri; Masakatu Morii 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 2 views

The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po

On the MacWilliams identities for linear

On the MacWilliams identities for linear codes

✍ Richard A. Brualdi; Vera S. Pless; Janet S. Beissinger 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 713 KB

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

On the extendability of steiner t-design

On the extendability of steiner t-designs

✍ Alphonse H. Baartmans; Ian F. Blake; Vladimir D. Tonchev 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 448 KB

Necessary and sufficient conditions for the extendability of residual designs of Steiner systems S ( t , t + 1, v) are studied. In particular, it is shown that a residual design with respect to a single point is uniquely extendable, and the extendability of a residual design with respect to a pair o