New families of completely regular codes and their corresponding distance regular coset graphs
From MaRDI portal
Publication:2436559
DOI10.1007/s10623-012-9713-3zbMath1315.94137OpenAlexW2017838453MaRDI QIDQ2436559
Josep Rifà, Joaquim Borges, Victor A. Zinoviev
Publication date: 25 February 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9713-3
Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Other types of codes (94B60) Combinatorial codes (94B25)
Related Items
Entry-faithful 2-neighbour transitive codes, Unnamed Item, Families of completely transitive codes and distance transitive graphs, On completely regular codes, Conway groupoids and completely transitive codes, 2-neighbour-transitive codes with small blocks of imprimitivity, On the classification of binary completely transitive codes with almost-simple top-group, Families of nested completely regular codes and distance-regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(q\)-ary linear completely regular codes with \(\rho=2\) and antipodal dual
- On new completely regular \(q\)-ary codes
- On non-antipodal binary completely regular codes
- Completely regular codes
- Distance regular covers of the complete graph
- Two infinite classes of perfect codes in metrically regular graphs
- Tight distance-regular graphs
- Two linear transformations each tridiagonal with respect to an eigenbasis of the other; comments on the parameter array
- A family of antipodal distance-regular graphs related to the classical Preparata codes
- Perfect colorings of the 12-cube that attain the bound on correlation immunity
- Characterizing completely regular codes from an algebraic viewpoint
- On Z/sub 4/-linear preparata-like and kerdock-like codes
- Regular 2-Graphs
- On Lifting Perfect Codes
