On \(q\)-ary codes with two distances \(d\) and \(d+1\)

DOI10.1134/S0032946020010044zbMath1473.94134arXiv1906.09645MaRDI QIDQ2190983

Dmitrii Zinoviev, Victor A. Zinoviev, Konstantin Delchev, P. G. Boyvalenkov

Publication date: 23 June 2020

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

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

zbMATH Keywords

equidistant codesbounds for codestwo-distance codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (3)

On two-weight codes ⋮ On the classification of completely regular codes with covering radius two and antipodal duals ⋮ On codes with distances \(d\) and \(n\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the construction of \(q\)-ary equidistant codes
• Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes
• On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes
• Bounds on sets with few distances
• The Geometry of Two-Weight Codes
• On Two-Distance Sets in Euclidean Space
• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• On Linear Codes of Almost Constant Weight and the Related Arcs
• On completely regular codes

This page was built for publication: On \(q\)-ary codes with two distances \(d\) and \(d+1\)