On completely regular codes
From MaRDI portal
Publication:5970864
DOI10.1134/S0032946019010010zbMath1452.94133arXiv1703.08684OpenAlexW2599600651MaRDI QIDQ5970864
Joaquim Borges, Josep Rifà, Victor A. Zinoviev
Publication date: 23 June 2020
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.08684
Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (18)
On the non-existence of extended 1-perfect codes and MDS codes ⋮ Minimum supports of eigenfunctions of graphs: a survey ⋮ 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 ⋮ Neighbour-transitive codes and partial spreads in generalised quadrangles ⋮ On completely regular codes with minimum eigenvalue in geometric graphs ⋮ On \(q\)-ary codes with two distances \(d\) and \(d+1\) ⋮ On the classification of completely regular codes with covering radius two and antipodal duals ⋮ Equitable 2-partitions of the Hamming graphs with the second eigenvalue ⋮ 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 ⋮ Perfect colorings of the infinite square grid: coverings and twin colors ⋮ \(s\)-elusive codes in Hamming graphs ⋮ 2-neighbour-transitive codes with small blocks of imprimitivity ⋮ 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
Cites Work
- Distance-regular graphs
- On a family of binary completely transitive codes with growing covering radius
- Completely regular codes with different parameters giving the same distance-regular coset graphs
- On \(q\)-ary linear completely regular codes with \(\rho=2\) and antipodal dual
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- A note on the existence of perfect constant weight codes
- On complete regularity of extended codes
- Induced perfect colorings
- Completely regular codes and completely transitive codes
- A note on completely regular codes
- On new completely regular \(q\)-ary codes
- On non-antipodal binary completely regular codes
- On the regularity of perfect 2-colorings of the Johnson graph
- On a class of binary linear completely transitive codes with arbitrary covering radius
- On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
- On the non-existence of perfect and nearly perfect codes
- On \(r\)-partition designs in Hamming spaces
- Completely regular codes
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Completely regular designs of strength one
- Completely regular codes by concatenating Hamming codes
- Completely transitive codes in Hamming graphs
- Perfect codes in Johnson schemes
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Cycle-balance conditions for distance-regular graphs
- 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
- Completely regular codes in the infinite hexagonal grid
- New families of completely regular codes and their corresponding distance regular coset graphs
- A bound on correlation immunity
- Perfect colorings of the 12-cube that attain the bound on correlation immunity
- Transitivity of finite permutation groups on unordered sets
- Some problems involving powers of integers
- Configuration distribution and designs of codes in the Johnson scheme
- New classes of almost bent and almost perfect nonlinear polynomials
- Perfect Constant-Weight Codes
- Perfect Single Error-Correcting Codes in the Johnson Scheme
- On Almost Perfect Nonlinear Functions Over$mmb F_2^n$
- On the Preparata and Goethals codes
- The Geometry of Two-Weight Codes
- Generalized t-designs and majority decoding of linear codes
- Codes in Bipartite Distance-Regular Graphs
- All nearly perfect codes are known
- Completely regular designs
- The automorphism group of double-error-correcting BCH codes
- Detecting perfect powers in essentially linear time
- Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
- On the nonexistence of completely transitive codes
- Nonexistence of completely transitive codes with error-correcting capability e<3
- On the Nonexistence of Perfect Codes in the Johnson Scheme
- On Almost Perfect Nonlinear Permutations
- New Completely Regular $q$-ary Codes Based on Kronecker Products
- On Lifting Perfect Codes
- New characterisations of the Nordstrom–Robinson codes
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- On the Nonexistence of Perfect Codes over Finite Fields
- Orthogonal Arrays of Index Unity
- A proof of the Welch and Niho conjectures on cross-correlations of binary \(m\)-sequences
- Antipodal distance-transitive covers of complete bipartite graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On completely regular codes
