On codes with distances d and n

DOI10.1134/S0032946022040068MaRDI QIDQ6173474zbMATH OpenOpenAlexFDO

Authors Peter Boyvalenkov, Konstantin Delchev, Victor A. Zinoviev, Dmitrii 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

zbMATH Keywords

bounds for codesdifference matrixLatin squarelinear programming boundslinear two-weight codemaximal arcorthogonal arrayspherical codetwo-distance codetwo-weight code

Mathematics Subject Classification ID

Bounds on codes (94B65)

Recommendations

• On the distance distribution of codes
• Code distances of some classes of (p,p)-codes
• scientific article; zbMATH DE number 26839
• On \(q\)-ary codes with two distances \(d\) and \(d+1\)
• scientific article; zbMATH DE number 3985112
• Bounds on distance distributions in codes of given size
• scientific article; zbMATH DE number 910957
• On codes with given minimum distance and covering radius
• scientific article; zbMATH DE number 1505644
• scientific article; zbMATH DE number 1189027

Cites work

• Construction of maximal arcs and partial geometries
• Constructions of binary codes with two distances
• scientific article; zbMATH DE number 3970750 (Why is no real title available?)
• scientific article; zbMATH DE number 3700716 (Why is no real title available?)
• scientific article; zbMATH DE number 3463505 (Why is no real title available?)
• scientific article; zbMATH DE number 3438734 (Why is no real title available?)
• scientific article; zbMATH DE number 749958 (Why is no real title available?)
• Maximal arcs in Desarguesian planes of odd order do not exist
• On \(q\)-ary codes with two distances \(d\) and \(d+1\)
• On \(q\)-ary linear completely regular codes with \(\rho=2\) and antipodal dual
• On linear codes of almost constant weight and the related arcs
• On Two-Distance Sets in Euclidean Space
• On two-weight codes
• Orthogonal Arrays of Index Unity
• Orthogonal Arrays of Strength two and three
• Some maximal arcs in finite projective planes
• The Geometry of Two-Weight Codes
• The Grey-Rankin bound for nonbinary codes
• Two New Families of Two-Weight Codes
• Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances
• Upper bounds for \(s\)-distance sets and equiangular lines
• Weights of linear codes and strongly regular normed spaces

Cited in

(17)

• Code distances of some classes of (p,p)-codes
• Upper bounds for the cardinality of s-distances codes
• Orthogonal vectors in the n-dimensional cube and codes with missing distances
• On \(q\)-ary codes with two distances \(d\) and \(d+1\)
• On the distance between linear codes
• Estimates of the distance distribution of codes and designs
• scientific article; zbMATH DE number 4150083 (Why is no real title available?)
• Some results on the norm of codes
• Distance properties of expander codes
• scientific article; zbMATH DE number 1189027 (Why is no real title available?)
• scientific article; zbMATH DE number 4127151 (Why is no real title available?)
• Estimates of the distance distribution of codes and designs
• Codes on Garcia-Stichtenoth curves with true distance greater than Feng-Rao distance
• scientific article; zbMATH DE number 910957 (Why is no real title available?)
• On the classification of completely regular codes with covering radius two and antipodal duals
• On binary codes with distances d and d+2
• On the high density behavior of Hamming codes with fixed minimum distance

This page was built for publication: On codes with distances \(d\) and \(n\)

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