On the nonexistence of completely transitive codes

DOI10.1109/18.817528zbMath0999.94034OpenAlexW2130234052MaRDI QIDQ4503518

Joaquim Borges, Josep Rifà

Publication date: 7 September 2000

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c46a5906ce272626ef4957f765957287cabd216e

zbMATH Keywords

completely regular codespermutation groupscompletely transitive codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (7)

Entry-faithful 2-neighbour transitive codes ⋮ Neighbour transitivity on codes in Hamming graphs ⋮ On completely regular codes ⋮ On non-antipodal binary completely regular codes ⋮ 2-neighbour-transitive codes with small blocks of imprimitivity ⋮ On a class of binary linear completely transitive codes with arbitrary covering radius ⋮ On completely regular binary codes and t-designs∗

This page was built for publication: On the nonexistence of completely transitive codes