✦ LIBER ✦

A note on codes having no finite completions

✍ Scribed by Nguyen Huong Lam

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 370 KB
Volume: 55
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00102-i

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On codes having no finite completions

✍ Antonio Restivo 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 850 KB

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.

A note on ext-completions

✍ A.E Stratton 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 227 KB

A Note on Greedy Codes

✍ D. Fon-Der-Flaass 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 214 KB

In their paper (J. Combin. Theory Ser. A 64 (1993), 10 30) Brualdi and Pless prove linearity of some binary codes obtained by a greedy algorithm and establish lower bounds for the dimension of these codes. In this note, we show that actually they have proved a much more general result, and show that

On a personal note governance codes

✍ John Carver; Miriam Carver 📂 Article 📅 2005 🏛 John Wiley and Sons ⚖ 249 KB 👁 2 views

A note on self-orthogonal codes

✍ Alexander Pott 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 124 KB