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

2019/06/23 by Boyvalenkov, P., Delchev, K., Zinoviev, D. +1
#94B60 #94B65 #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1906.09645

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.

Related

• On two-weight codes
• Bounds on Box Codes
• Bounds for the l₁-distance of q-ary lattices obtained via Constructions D, D^' and D
• Asymptotically optimal constant weight codes with even distance
• A class of q-ary linear codes derived from irreducible cyclic codes