Completely regular codes and completely transitive codes
From MaRDI portal
Publication:911558
Recommendations
Cites work
- Automorphism groups of Hadamard matrices
- Four fundamental parameters of a code and their combinatorial significance
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3871188 (Why is no real title available?)
- scientific article; zbMATH DE number 3695090 (Why is no real title available?)
- scientific article; zbMATH DE number 3763833 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 493079 (Why is no real title available?)
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Linear codes with given automorphism groups
- Nonlinear codes defined by quadratic forms over GF(2)
- On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
- On the covering radius of codes
- On the Preparata and Goethals codes
- Transitivity of finite permutation groups on unordered sets
Cited in
(45)- On a class of binary linear completely transitive codes with arbitrary covering radius
- Completely regular codes
- Metric coset schemes revisited
- About non equivalent completely regular codes with identical intersection array
- Completely regular codes by concatenating Hamming codes
- Completely transitive codes in Hamming graphs
- Neighbour transitivity on codes in Hamming graphs
- On the classification of binary completely transitive codes with almost-simple top-group
- Coordinate transitivity of a class of extended perfect codes and their SQS
- Dual distances of completely regular codes
- On completely regular and completely transitive supplementary codes
- 2-neighbour-transitive codes with small blocks of imprimitivity
- Minimal binary 2-neighbour-transitive codes
- A new distance-regular graph of diameter 3 on 1024 vertices
- Families of nested completely regular codes and distance-regular graphs
- Uniqueness of certain completely regular Hadamard codes
- Combinatorial vs. algebraic characterizations of completely pseudo-regular codes
- New families of completely regular codes and their corresponding distance regular coset graphs
- Families of completely transitive codes and distance transitive graphs
- Entry-faithful 2-neighbour transitive codes
- Characterizing completely regular codes from an algebraic viewpoint
- On completely regular binary codes and t-designs∗
- On the Kronecker Product Construction of Completely Transitive q-Ary Codes
- scientific article; zbMATH DE number 4072866 (Why is no real title available?)
- On a family of binary completely transitive codes with growing covering radius
- scientific article; zbMATH DE number 177889 (Why is no real title available?)
- On the binary codes with parameters of triply-shortened 1-perfect 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
- Characters and Brauer trees of the covering group of \({{}^2E_6(2)}\)
- Conway's groupoid and its relatives
- Completely regular codes with different parameters giving the same distance-regular coset graphs
- New characterisations of the Nordstrom-Robinson codes
- Theoretical Aspects of Computing – ICTAC 2005
- Minimum distance bounds for s-regular codes
- On completely regular codes
- On new infinite families of completely regular and completely transitive codes
- Completely regular codes in the n-dimensional rectangular grid
- Alphabet-affine 2-neighbour-transitive codes
- On complete regularity of extended codes
- On self-dual completely regular codes with covering radius 3
- A note on completely regular codes
- On new completely regular q-ary codes
- On non-antipodal binary completely regular codes
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)
