Pages that link to "Item:Q1949232"
From MaRDI portal
The following pages link to Neighbour transitivity on codes in Hamming graphs (Q1949232):
Displaying 15 items.
- Entry-faithful 2-neighbour transitive codes (Q281316) (← links)
- Increasing the minimum distance of codes by twisting (Q1671660) (← links)
- Completely transitive codes in Hamming graphs (Q1817591) (← links)
- Neighbour transitivity on codes in Hamming graphs (Q1949232) (← links)
- \(s\)-elusive codes in Hamming graphs (Q2034987) (← links)
- On the classification of binary completely transitive codes with almost-simple top-group (Q2080231) (← links)
- Coordinate transitivity of a class of extended perfect codes and their SQS (Q2201011) (← links)
- Sporadic neighbour-transitive codes in Johnson graphs (Q2249651) (← links)
- 2-neighbour-transitive codes with small blocks of imprimitivity (Q2294111) (← links)
- Minimal binary 2-neighbour-transitive codes (Q2299621) (← links)
- Diagonally neighbour transitive codes and frequency permutation arrays (Q2454089) (← links)
- Neighbour-transitive codes in Johnson graphs (Q2510649) (← links)
- Neighbour-transitive codes and partial spreads in generalised quadrangles (Q2672306) (← links)
- Elusive codes in Hamming graphs (Q2865132) (← links)
- Alphabet-almost-simple 2-neighbour-transitive codes (Q4577872) (← links)