✦ LIBER ✦

Two theorems on perfect codes

✍ Scribed by H.W. Lenstra Jr.

Book ID: 107748117
Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 630 KB
Volume: 3
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(72)90028-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reconstruction theorems for centered fun

Reconstruction theorems for centered functions and perfect codes

✍ S. V. Avgustinovich; A. Yu. Vasil’eva 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 127 KB

On perfect arithmetic codes

✍ Antoine C. Lobstein 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Lobstein, A.C., On perfect arithmetic codes, Discrete Mathematics 106/107 (1992) 333-336 This short paper treats the perfect codes, in the case of arithmetic codes and Garcia-Rao modular distance.

On perfect binary codes

✍ Faina I. Solov’eva 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 206 KB

On perfect deletion-correcting codes

✍ Andreas Klein 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

## Abstract In this article, we present constructions for perfect deletion‐correcting codes. The first construction uses perfect deletion‐correcting codes without repetition of letters to construct other perfect deletion‐correcting codes. This is a generalization of the construction shown in 1. In

On New Perfect Binary Nonlinear Codes

✍ A. C. Lobstein; V. A. Zinoviev 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 193 KB

A note on perfect Lee-codes

✍ A.I. Riihonen 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 206 KB