On Lifting Perfect Codes

DOI10.1109/TIT.2010.2103410MaRDI QIDQ5272368zbMATH OpenOpenAlexFDO

Authors Josep Rifà, Victor A. Zinoviev

Publication date 12 July 2017

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

Full work available at URL https://doi.org/10.1109/tit.2010.2103410

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cited in

(13)

• About non equivalent completely regular codes with identical intersection array
• Families of nested completely regular codes and distance-regular graphs
• New families of completely regular codes and their corresponding distance regular coset graphs
• Characters and Brauer trees of the covering group of \({{}^2E_6(2)}\)
• Conway's groupoid and its relatives
• Completely regular codes with different parameters giving the same distance-regular coset graphs
• On completely regular codes
• A Go-Up code construction from linear codes yielding additive codes for quantum stabilizer codes
• Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs
• Any lifting of a trace coding is a word coding
• New infinite families of uniformly packed near-MDS codes and multiple coverings, based on the ternary Golay code
• The third generalized covering radius for binary primitive double-error-correcting BCH codes
• Conway groupoids and completely transitive codes

This page was built for publication: On Lifting Perfect Codes

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