On two-weight codes
From MaRDI portal
Publication:2659228
DOI10.1016/j.disc.2021.112318zbMath1475.94213arXiv2005.13623OpenAlexW3126710014MaRDI QIDQ2659228
Dmitrii Zinoviev, P. G. Boyvalenkov, Konstantin Delchev, Victor A. Zinoviev
Publication date: 25 March 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.13623
two-weight codesbounds on codeslinear codeserror-correcting codeslinear programming boundunrestricted codes
Related Items (3)
On the classification of completely regular codes with covering radius two and antipodal duals ⋮ On codes with distances \(d\) and \(n\) ⋮ Constructions of binary codes with two distances
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Grey-Rankin bound for nonbinary codes
- On \(q\)-ary codes with two distances \(d\) and \(d+1\)
- Weights of linear codes and strongly regular normed spaces
- 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
- Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances
- Some maximal arcs in finite projective planes
- Orthogonal Arrays of Index Unity
This page was built for publication: On two-weight codes