✦ LIBER ✦

On graphs and codes

✍ Scribed by R. T. Curtis

Publisher: Springer
Year: 1992
Tongue: English
Weight: 281 KB
Volume: 41
Category: Article
ISSN: 0046-5755
DOI: 10.1007/bf00182413

No coin nor oath required. For personal study only.

✦ Synopsis

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 merely a special case of a general method of constructing codes from graphs. Codes with certain properties, such as self-orthogonality, can be obtained by putting certain conditions on the graph with which we start.

📜 SIMILAR VOLUMES

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

Perfect codes in graphs

✍ Norman Biggs 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 396 KB

Codes And Xor Graph Products

✍ Noga Alon*; Eyal Lubetzky† 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 280 KB

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

Perfect codes in the graphs Ok

✍ P Hammond; D.H Smith 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 881 KB