On \(q\)-ary codes with two distances \(d\) and \(d+1\) (Q2190983): Difference between revisions

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\).