On the nonexistence of completely transitive codes

DOI10.1109/18.817528MaRDI QIDQ4503518zbMATH OpenOpenAlexFDO

Authors J. 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 codescompletely transitive codespermutation groups

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Nonexistence of completely transitive codes with error-correcting capability e<3
• scientific article; zbMATH DE number 7029854
• Completely regular codes and completely transitive codes
• Transitive nonpropelinear perfect codes
• On extremely transitive extended perfect codes

Cited in

(17)

• On a class of binary linear completely transitive codes with arbitrary covering radius
• Neighbour transitivity on codes in Hamming graphs
• 2-neighbour-transitive codes with small blocks of imprimitivity
• Constructing error-correcting binary codes using transitive permutation groups
• On the construction of transitive codes
• Entry-faithful 2-neighbour transitive codes
• On completely regular binary codes and t-designs∗
• Doubly transitive groups of type pm(pm?1) and maximal nonbinary codes generated by them
• On codes having no finite completion
• Nonexistence of completely transitive codes with error-correcting capability e<3
• scientific article; zbMATH DE number 7029854 (Why is no real title available?)
• Transitive nonpropelinear perfect codes
• New characterisations of the Nordstrom-Robinson codes
• Theoretical Aspects of Computing – ICTAC 2005
• On completely regular codes
• On complete regularity of extended codes
• On non-antipodal binary completely regular codes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503518)