On the classification of completely regular codes with covering radius two and antipodal duals

DOI10.1134/s003294602303002xarXiv2302.10556OpenAlexW4393187272MaRDI QIDQ6125767

Dmitrii Zinoviev, Victor A. Zinoviev, Joaquim Borges

Publication date: 11 April 2024

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.10556

zbMATH Keywords

Hadamard matrixHamming codeLatin squaredifference matrixtwo-weight codeequidistant codemaximal arcprojective ovalcode with antipodal dualcode with covering radius 2linear completely regular code

Mathematics Subject Classification ID

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

Cites Work

• Distance-regular graphs
• The Grey-Rankin bound for nonbinary codes
• On \(q\)-ary linear completely regular codes with \(\rho=2\) and antipodal dual
• Classification of Griesmer codes and dual transform
• Maximal arcs in Desarguesian planes of odd order do not exist
• On \(q\)-ary codes with two distances \(d\) and \(d+1\)
• Weights of linear codes and strongly regular normed spaces
• On two-weight codes
• The Geometry of Two-Weight Codes
• Some maximal arcs in finite projective planes
• Orthogonal Arrays of Index Unity
• On completely regular codes
• On codes with distances \(d\) and \(n\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the classification of completely regular codes with covering radius two and antipodal duals