On q-ary Codes with Two Distances d and d + 1
Peter Boyvalenkov, Константин Делчев, D. V. Zinoviev, Victor A. Zinoviev · Problems of Information Transmission · 2020
We consider q -ary block codes with exactly two distances: d and d + 1. Several constructions of such codes are given. In the linear case, we show that all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for the maximum cardinality of such codes are derived. Tables of lower and upper bounds for small q and n are presented.