𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Families of completely transitive codes and distance transitive graphs

✍ Scribed by Borges, J.; Rifà, J.; Zinoviev, V.A.

Book ID
122220822
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
361 KB
Volume
324
Category
Article
ISSN
0012-365X

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

Completely regular codes and completely
Completely regular codes and completely transitive codes
✍ Patrick Solé 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 511 KB

A binary code C is said to be completely regular if the weight distribution of any translate x + C depends only on the distance of x to C. Such codes are related to designs and distance regular graphs. Their covering radius is equal to their external distance. All perfect and uniformly packed codes

Locally s-distance transitive graphs
Locally s-distance transitive graphs
✍ Alice Devillers; Michael Giudici; Cai Heng Li; Cheryl E. Praeger 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB