Nonexistence of completely transitive codes with error-correcting capability e<3
From MaRDI portal
Publication:4544600
DOI10.1109/18.923747zbMath1017.94015OpenAlexW2159941431MaRDI QIDQ4544600
Victor A. Zinoviev, Joaquim Borges, Josep Rifà
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.923747
Related Items (10)
Entry-faithful 2-neighbour transitive codes ⋮ Neighbour-transitive codes and partial spreads in generalised quadrangles ⋮ Neighbour-transitive codes in Kneser graphs ⋮ Neighbour transitivity on codes in Hamming graphs ⋮ On completely regular codes ⋮ On non-antipodal binary completely regular codes ⋮ Minimal binary 2-neighbour-transitive codes ⋮ A new distance-regular graph of diameter 3 on 1024 vertices ⋮ On the classification of binary completely transitive codes with almost-simple top-group ⋮ On a class of binary linear completely transitive codes with arbitrary covering radius
This page was built for publication: Nonexistence of completely transitive codes with error-correcting capability e<3
