On codes with distances \(d\) and \(n\)
From MaRDI portal
Publication:6173474
DOI10.1134/s0032946022040068zbMath1521.94136OpenAlexW4315564949MaRDI QIDQ6173474
Dmitrii Zinoviev, Konstantin Delchev, P. G. Boyvalenkov, Victor A. Zinoviev
Publication date: 21 July 2023
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946022040068
Latin squareorthogonal arrayspherical codedifference matrixtwo-weight codelinear programming boundsmaximal arcbounds for codeslinear two-weight codetwo-distance code
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Grey-Rankin bound for nonbinary codes
- On \(q\)-ary linear completely regular codes with \(\rho=2\) and antipodal dual
- Maximal arcs in Desarguesian planes of odd order do not exist
- Upper bounds for \(s\)-distance sets and equiangular lines
- Construction of maximal arcs and partial geometries
- On \(q\)-ary codes with two distances \(d\) and \(d+1\)
- Weights of linear codes and strongly regular normed spaces
- On two-weight codes
- Constructions of binary codes with two distances
- The Geometry of Two-Weight Codes
- On Two-Distance Sets in Euclidean Space
- Two New Families of Two-Weight Codes
- 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
- Orthogonal Arrays of Strength two and three
This page was built for publication: On codes with distances \(d\) and \(n\)
