Nonexistence of completely transitive codes with error-correcting capability e<3

DOI10.1109/18.923747zbMATH Open1017.94015OpenAlexW2159941431MaRDI QIDQ4544600FDOQ4544600

Authors: J. Borges, Josep Rifà, Victor A. Zinoviev 

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

Recommendations

• On the nonexistence of completely transitive codes
• Completely regular codes and completely transitive codes
• On extremely transitive extended perfect codes
• On a class of binary linear completely transitive codes with arbitrary covering radius
• scientific article; zbMATH DE number 177889

zbMATH Keywords

completely transitive codespermutation groupscompletely regular codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (12)

• On the nonexistence of completely transitive codes
• On non-antipodal binary completely regular codes
• On a class of binary linear completely transitive codes with arbitrary covering radius
• On completely regular codes
• Entry-faithful 2-neighbour transitive codes
• A new distance-regular graph of diameter 3 on 1024 vertices
• Neighbour transitivity on codes in Hamming graphs
• Neighbour-transitive codes in Kneser graphs
• Minimal binary 2-neighbour-transitive codes
• Neighbour-transitive codes and partial spreads in generalised quadrangles
• Title not available (Why is that?)
• On the classification of binary completely transitive codes with almost-simple top-group

This page was built for publication: Nonexistence of completely transitive codes with error-correcting capability e&lt;3

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