✦ LIBER ✦

Codes based on complete graphs

✍ Scribed by Dieter Jungnickel, Marialuisa J. De Resmini, Scott A. Vanstone

Book ID: 118771458
Publisher: Springer
Year: 1996
Tongue: English
Weight: 363 KB
Volume: 8
Category: Article
ISSN: 0925-1022
DOI: 10.1007/bf00130575

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Completely Transitive Codes in Hamming G

Completely Transitive Codes in Hamming Graphs

✍ Michael Giudici; Cheryl E. Praeger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 169 KB

A code in a graph is a non-empty subset C of the vertex set V of . Given C, the partition of V according to the distance of the vertices away from C is called the distance partition of C. A completely regular code is a code whose distance partition has a certain regularity property. A special class

A construction of Gray codes inducing co

A construction of Gray codes inducing complete graphs

✍ I Nengah Suparta; A.J. van Zanten 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 167 KB

Decoding codes on graphs

✍ A S Madhu; Aditya Nori 📂 Article 📅 2004 🏛 Indian Academy of Sciences 🌐 English ⚖ 665 KB

Decoding codes on graphs

✍ A. S. Madhu; Aditya Nori 📂 Article 📅 2003 🏛 Indian Academy of Sciences 🌐 English ⚖ 749 KB

On graphs and codes

✍ R. T. Curtis 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 281 KB

In a recent paper we showed how the binary Golay code can be obtained in a revealing way straight from the edge-graph of the icosahedron. This construction not only yields a natural basis for the code, but also supplies a simple description of all codewords. In this paper we show that the above is m

Codes defined on graphs

✍ Kschischang, F.R. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 110 KB