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

DOI10.1134/S0032946020010044MaRDI QIDQ2190983zbMATH OpenFDO

Authors Dmitrii Zinoviev, Peter Boyvalenkov, Konstantin Delchev, Victor A. Zinoviev

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

bounds for codesequidistant codestwo-distance codes

Mathematics Subject Classification ID

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

Abstract: The $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for the maximum cardinality of such codes is derived. Tables of lower and upper bounds for small $q$ and $n$ are presented.

Review text

In this work, the authors consider \(q\)-ary block codes with two distances (\(d\) and \(d+1\)). They present several constructions of such codes. In the linear case, the authors show that all codes can be obtained by a simple modification of linear equidistant codes. They derive upper bounds for the maximum cardinality of such codes. Also, they present tables of lower and upper bounds for small values of \(q\) and \(n\).

Recommendations

• On codes with distances \(d\) and \(n\)
• On two-weight codes
• On the Maximal Cardinality of Binary Two-weight Codes
• On the construction of q-ary equidistant codes
• Constructions of binary codes with two distances

Cites work

• Bounds on sets with few distances
• scientific article; zbMATH DE number 3827893 (Why is no real title available?)
• scientific article; zbMATH DE number 3970750 (Why is no real title available?)
• scientific article; zbMATH DE number 3463505 (Why is no real title available?)
• scientific article; zbMATH DE number 3480474 (Why is no real title available?)
• scientific article; zbMATH DE number 3410920 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes
• On completely regular codes
• On linear codes of almost constant weight and the related arcs
• On the construction of q-ary equidistant codes
• On Two-Distance Sets in Euclidean Space
• Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes
• The Geometry of Two-Weight Codes

Cited in

(16)

• Code distances of some classes of (p,p)-codes
• Upper bounds for the cardinality of s-distances codes
• On linear hash codes
• Bounds for the \(l_1\)-distance of \(q\)-ary lattices obtained via constructions \(\mathrm D\), \(\mathrm D'\) and \(\overline{\mathrm D}\)
• Codes that attain minimum distance in every possible direction
• On two-weight codes
• On Application of the Partition Distance Concept to a Comparative Analysis of Psychological or Sociological Tests
• scientific article; zbMATH DE number 26596 (Why is no real title available?)
• On the Maximal Cardinality of Binary Two-weight Codes
• Recent developments in Armstrong codes
• All q-ary equidistant codes of distance 3
• A construction of two-weight codes and its applications
• On the classification of completely regular codes with covering radius two and antipodal duals
• On codes with distances \(d\) and \(n\)
• Recursive construction of projective two-weight linear codes
• On the construction of q-ary equidistant codes

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

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