Completely regular codes and completely transitive codes
From MaRDI portal
Publication:911558
DOI10.1016/0012-365X(90)90152-8zbMath0696.94021MaRDI QIDQ911558
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
completely regular codescovering radiusdesignscompletely transitive codesdistance regular graphsPreparata codesGoethals codes
Related Items (26)
Entry-faithful 2-neighbour transitive codes ⋮ Alphabet-almost-simple 2-neighbour-transitive codes ⋮ On a family of binary completely transitive codes with growing covering radius ⋮ On new infinite families of completely regular and completely transitive codes ⋮ Coordinate transitivity of a class of extended perfect codes and their SQS ⋮ Neighbour transitivity on codes in Hamming graphs ⋮ Families of completely transitive codes and distance transitive graphs ⋮ On completely regular codes ⋮ On the Kronecker Product Construction of Completely Transitive q-Ary Codes ⋮ Characters and Brauer trees of the covering group of ²𝐸₆(2) ⋮ Conway’s groupoid and its relatives ⋮ On non-antipodal binary completely regular codes ⋮ About non equivalent completely regular codes with identical intersection array ⋮ On complete regularity of extended codes ⋮ Completely regular codes with different parameters giving the same distance-regular coset graphs ⋮ Completely regular codes by concatenating Hamming codes ⋮ On completely regular and completely transitive supplementary codes ⋮ 2-neighbour-transitive codes with small blocks of imprimitivity ⋮ Minimal binary 2-neighbour-transitive codes ⋮ Completely transitive codes in Hamming graphs ⋮ A new distance-regular graph of diameter 3 on 1024 vertices ⋮ On the classification of binary completely transitive codes with almost-simple top-group ⋮ On a class of binary linear completely transitive codes with arbitrary covering radius ⋮ Metric coset schemes revisited ⋮ On completely regular binary codes and t-designs∗ ⋮ Families of nested completely regular codes and distance-regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
- Transitivity of finite permutation groups on unordered sets
- Linear codes with given automorphism groups
- On the Preparata and Goethals codes
- On the covering radius of codes
- Nonlinear codes defined by quadratic forms over GF(2)
- Four fundamental parameters of a code and their combinatorial significance
- Automorphism groups of Hadamard matrices
This page was built for publication: Completely regular codes and completely transitive codes
