On q-ary codes with two distances d and d+1
Information Theory
2019-06-25 v1 math.IT
Abstract
The -ary block codes with two distances and 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 and are presented.
Cite
@article{arxiv.1906.09645,
title = {On q-ary codes with two distances d and d+1},
author = {P. Boyvalenkov and K. Delchev and D. Zinoviev and V. Zinoviev},
journal= {arXiv preprint arXiv:1906.09645},
year = {2019}
}
Comments
12 pages