On completely regular codes
From MaRDI portal
Abstract: This work is a survey on completely regular codes. Known properties, relations with other combinatorial structures and constructions are stated. The existence problem is also discussed and known results for some particular cases are established. In particular, we present a few new results on completely regular codes with covering radius 2 and on extended completely regular codes.
Recommendations
Cites work
- A bound on correlation immunity
- A new distance-regular graph of diameter 3 on 1024 vertices
- A note on completely regular codes
- A note on the existence of perfect constant weight codes
- A proof of the Welch and Niho conjectures on cross-correlations of binary m-sequences
- All nearly perfect codes are known
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Antipodal distance-transitive covers of complete bipartite graphs
- Arithmetic completely regular codes
- Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
- Codes in Bipartite Distance-Regular Graphs
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Completely regular codes
- Completely regular codes and completely transitive codes
- Completely regular codes by concatenating Hamming codes
- Completely regular codes in the infinite hexagonal grid
- Completely regular codes with different parameters giving the same distance-regular coset graphs
- Completely regular designs
- Completely regular designs of strength one
- Completely transitive codes in Hamming graphs
- Configuration distribution and designs of codes in the Johnson scheme
- Constant weight perfect and D-representable codes
- Construction of new completely regular q-ary codes from perfect q-ary codes
- Cycle-balance conditions for distance-regular graphs
- Detecting perfect powers in essentially linear time
- Distance-regular graphs
- Families of nested completely regular codes and distance-regular graphs
- Generalized t-designs and majority decoding of linear codes
- scientific article; zbMATH DE number 1583931 (Why is no real title available?)
- scientific article; zbMATH DE number 1594289 (Why is no real title available?)
- scientific article; zbMATH DE number 5862915 (Why is no real title available?)
- scientific article; zbMATH DE number 3845586 (Why is no real title available?)
- scientific article; zbMATH DE number 3871188 (Why is no real title available?)
- scientific article; zbMATH DE number 3880584 (Why is no real title available?)
- scientific article; zbMATH DE number 5379405 (Why is no real title available?)
- scientific article; zbMATH DE number 3178047 (Why is no real title available?)
- scientific article; zbMATH DE number 3695090 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 177889 (Why is no real title available?)
- scientific article; zbMATH DE number 3463505 (Why is no real title available?)
- scientific article; zbMATH DE number 3480474 (Why is no real title available?)
- scientific article; zbMATH DE number 3497777 (Why is no real title available?)
- scientific article; zbMATH DE number 3499621 (Why is no real title available?)
- scientific article; zbMATH DE number 3499625 (Why is no real title available?)
- scientific article; zbMATH DE number 3521851 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3616332 (Why is no real title available?)
- scientific article; zbMATH DE number 3627058 (Why is no real title available?)
- scientific article; zbMATH DE number 524126 (Why is no real title available?)
- scientific article; zbMATH DE number 1382770 (Why is no real title available?)
- scientific article; zbMATH DE number 874500 (Why is no real title available?)
- scientific article; zbMATH DE number 3893212 (Why is no real title available?)
- scientific article; zbMATH DE number 2192212 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Induced perfect colorings
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- New characterisations of the Nordstrom-Robinson codes
- New classes of almost bent and almost perfect nonlinear polynomials
- New Completely Regular q-ary Codes Based on Kronecker Products
- New families of completely regular codes and their corresponding distance regular coset graphs
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- Nonexistence of completely transitive codes with error-correcting capability e<3
- On \(q\)-ary linear completely regular codes with \(\rho=2\) and antipodal dual
- On \(r\)-partition designs in Hamming spaces
- On a class of binary linear completely transitive codes with arbitrary covering radius
- On a family of binary completely transitive codes with growing covering radius
- On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
- On Almost Perfect Nonlinear Functions Overmmb F₂ⁿ
- On Almost Perfect Nonlinear Permutations
- On complete regularity of extended codes
- On Lifting Perfect Codes
- On new completely regular q-ary codes
- On non-antipodal binary completely regular codes
- On nonexistence of some perfect 2-colorings of Johnson graphs
- On the non-existence of perfect and nearly perfect codes
- On the nonexistence of completely transitive codes
- On the Nonexistence of Perfect Codes in the Johnson Scheme
- On the Nonexistence of Perfect Codes over Finite Fields
- On the Preparata and Goethals codes
- On the regularity of perfect 2-colorings of the Johnson graph
- Orthogonal Arrays of Index Unity
- Perfect 2-colorings of the Johnson graphs J(8,3) and J(8,4)
- Perfect codes in Johnson schemes
- Perfect colorings of the 12-cube that attain the bound on correlation immunity
- Perfect Constant-Weight Codes
- Perfect Single Error-Correcting Codes in the Johnson Scheme
- Some problems involving powers of integers
- The automorphism group of double-error-correcting BCH codes
- The CRC handbook of combinatorial designs
- The Geometry of Two-Weight Codes
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Transitivity of finite permutation groups on unordered sets
- Uniqueness of certain completely regular Hadamard codes
Cited in
(35)- Completely regular codes
- s-elusive codes in Hamming graphs
- On the classification of binary completely transitive codes with almost-simple top-group
- A new construction of two-, three- and few-weight codes via our GU codes and their applications
- On the non-existence of extended 1-perfect codes and MDS codes
- Completely regular codes in Johnson and Grassmann graphs with small covering radii
- Minimum supports of eigenfunctions with the second largest eigenvalue of the star graph
- On \(q\)-ary codes with two distances \(d\) and \(d+1\)
- Equitable 2-partitions of the Hamming graphs with the second eigenvalue
- 2-neighbour-transitive codes with small blocks of imprimitivity
- Completely regular codes in the infinite hexagonal grid
- Neighbour-transitive codes and partial spreads in generalised quadrangles
- Perfect colorings of the infinite square grid: coverings and twin colors
- On some topics in combinatorial coding theory
- Characterizing completely regular codes from an algebraic viewpoint
- scientific article; zbMATH DE number 4110626 (Why is no real title available?)
- On \(q\)-ary linear completely regular codes with \(\rho=2\) and antipodal dual
- scientific article; zbMATH DE number 6665189 (Why is no real title available?)
- Minimum supports of eigenfunctions of graphs: a survey
- On completely regular codes with minimum eigenvalue in geometric graphs
- On the classification of completely regular codes with covering radius two and antipodal duals
- Perfect 2‐colorings of Hamming graphs
- On new infinite families of completely regular and completely transitive codes
- Neighbour-transitive codes in Kneser graphs
- The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes
- On extended 1-perfect bitrades
- Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs
- On nonlinear 1-quasi-perfect codes and their structural properties
- Regular sets in Cayley sum graphs
- Alphabet-affine 2-neighbour-transitive codes
- New infinite families of uniformly packed near-MDS codes and multiple coverings, based on the ternary Golay code
- On complete regularity of extended codes
- Perfect colourings of hypergraphs
- On self-dual completely regular codes with covering radius 3
- A note on completely regular codes
This page was built for publication: On completely regular codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5970864)
