𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Codes And Xor Graph Products

✍ Scribed by Noga Alon*; Eyal Lubetzky†

Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
280 KB
Volume
27
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Codes and Anticodes in the Grassman Grap
Codes and Anticodes in the Grassman Graph
✍ Moshe Schwartz; Tuvi Etzion 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 132 KB

Perfect codes and optimal anticodes in the Grassman graph G q (n, k) are examined. It is shown that the vertices of the Grassman graph cannot be partitioned into optimal anticodes, with a possible exception when n=2k. We further examine properties of diameter perfect codes in the graph. These codes

On graphs and codes
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

Tight products and graph expansion
Tight products and graph expansion
✍ Amit Daniely; Nathan Linial 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB

## Abstract In this article, we study a new product of graphs called __tight product__. A graph __H__ is said to be a tight product of two (undirected multi) graphs __G__~1~ and __G__~2~, if __V__(__H__) = __V__(__G__~1~) × __V__(__G__~2~) and both projection maps __V__(__H__)→__V__(__G__~1~) and _