1 citations · 1 across the 2 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2020
On two-weight codes
P. G. Boyvalenkov, K. V. Delchev, D. V. Zinoviev +1
We consider -ary (linear and nonlinear) block codes with exactly two distances: and . Several combinatorial constructions of optimal such codes are given. In the linear…
cs.IT2019★ 1 cited
On q-ary codes with two distances d and d+1
P. Boyvalenkov, K. Delchev, D. Zinoviev +1
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…