Pages that link to "Item:Q2440945"
From MaRDI portal
The following pages link to Families of completely transitive codes and distance transitive graphs (Q2440945):
Displaying 15 items.
- Entry-faithful 2-neighbour transitive codes (Q281316) (← links)
- On a family of binary completely transitive codes with growing covering radius (Q394307) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- Completely regular codes and completely transitive codes (Q911558) (← links)
- On a class of binary linear completely transitive codes with arbitrary covering radius (Q1044974) (← links)
- On the classification of binary completely transitive codes with almost-simple top-group (Q2080231) (← links)
- 2-neighbour-transitive codes with small blocks of imprimitivity (Q2294111) (← links)
- Minimal binary 2-neighbour-transitive codes (Q2299621) (← links)
- A new distance-regular graph of diameter 3 on 1024 vertices (Q2324787) (← links)
- Families of nested completely regular codes and distance-regular graphs (Q2346713) (← links)
- New families of completely regular codes and their corresponding distance regular coset graphs (Q2436559) (← links)
- Neighbour-transitive codes and partial spreads in generalised quadrangles (Q2672306) (← links)
- Alphabet-almost-simple 2-neighbour-transitive codes (Q4577872) (← links)
- Transitive distance-regular graphs from linear groups $L(3,q)$, $q = 2,3,4,5$ (Q4997217) (← links)
- Conway’s groupoid and its relatives (Q5138279) (← links)