✦ LIBER ✦

Generative binary codes

✍ Scribed by M. Haft; R. Hofman; V. Tresp

Publisher: Springer-Verlag
Year: 2004
Tongue: English
Weight: 551 KB
Volume: 6
Category: Article
ISSN: 1433-7541
DOI: 10.1007/s10044-003-0194-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized H-codes and doubly even self

Generalized H-codes and doubly even self-dual binary codes

✍ R. Wei; L. Zhu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 286 KB

Binary codes and caps

✍ Aiden A. Bruen; Lucien Haddad; David L. Wehlau 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

The connection between maximal caps (sometimes called complete caps) and certain binary codes called quasi-perfect codes is described. We provide a geometric approach to the foundational work of Davydov and Tombak who have obtained the exact possible sizes of large maximal caps. A new self-contained

Asymmetric Binary Covering Codes

✍ Joshua N Cooper; Robert B Ellis; Andrew B Kahng 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 170 KB

An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Q n such that every vector x 2 Q n can be obtained from some vector c 2 C by changing at most R 1's of c to 0's, where R is as small as possible. K þ ðn; RÞ is defined as the smallest size of such a code. We show

Binary tree gray codes

✍ Andrzej Proskurowski; Frank Ruskey 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 619 KB

Rigid linear binary codes

✍ Hanno Lefmann; Kevin T Phelps; Vojtěch Rödl 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 669 KB

Classification of binary covering codes

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