Completely regular codes and completely transitive codes
From MaRDI portal
DOI10.1016/0012-365X(90)90152-8zbMATH Open0696.94021MaRDI QIDQ911558FDOQ911558
Authors: Patrick Solé 
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
covering radiuscompletely transitive codesdistance regular graphsdesignscompletely regular codesPreparata codesGoethals codes
Cites Work
- Title not available (Why is that?)
- Transitivity of finite permutation groups on unordered sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Four fundamental parameters of a code and their combinatorial significance
- Title not available (Why is that?)
- Automorphism groups of Hadamard matrices
- Linear codes with given automorphism groups
- On the Preparata and Goethals codes
- On the covering radius of codes
- On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
- Nonlinear codes defined by quadratic forms over GF(2)
- Title not available (Why is that?)
Cited In (41)
- On a family of binary completely transitive codes with growing covering radius
- On complete regularity of extended codes
- On the nonexistence of completely transitive codes
- Nonexistence of completely transitive codes with error-correcting capability e<3
- Alphabet-almost-simple 2-neighbour-transitive codes
- On non-antipodal binary completely regular codes
- Conway's groupoid and its relatives
- On a class of binary linear completely transitive codes with arbitrary covering radius
- A note on completely regular codes
- On completely regular codes
- Entry-faithful 2-neighbour transitive codes
- About non equivalent completely regular codes with identical intersection array
- Completely regular codes
- On new completely regular \(q\)-ary codes
- Characters and Brauer trees of the covering group of \({{}^2E_6(2)}\)
- On the binary codes with parameters of triply-shortened 1-perfect codes
- Theoretical Aspects of Computing – ICTAC 2005
- Metric coset schemes revisited
- A new distance-regular graph of diameter 3 on 1024 vertices
- Combinatorial vs. algebraic characterizations of completely pseudo-regular codes
- Completely regular codes by concatenating Hamming codes
- Title not available (Why is that?)
- Completely transitive codes in Hamming graphs
- Characterizing completely regular codes from an algebraic viewpoint
- Neighbour transitivity on codes in Hamming graphs
- On new infinite families of completely regular and completely transitive codes
- On the Kronecker Product Construction of Completely Transitive q-Ary Codes
- Minimum distance bounds for \(s\)-regular codes
- 2-neighbour-transitive codes with small blocks of imprimitivity
- Minimal binary 2-neighbour-transitive codes
- Uniqueness of certain completely regular Hadamard codes
- On completely regular and completely transitive supplementary codes
- New characterisations of the Nordstrom-Robinson codes
- New families of completely regular codes and their corresponding distance regular coset graphs
- Families of completely transitive codes and distance transitive graphs
- On the classification of binary completely transitive codes with almost-simple top-group
- On completely regular binary codes and t-designs∗
- Families of nested completely regular codes and distance-regular graphs
- Coordinate transitivity of a class of extended perfect codes and their SQS
- Title not available (Why is that?)
- Completely regular codes with different parameters giving the same distance-regular coset graphs
This page was built for publication: Completely regular codes and completely transitive codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911558)
