当前位置: X-MOL 学术Probl. Inf. Transm. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On q -ary Codes with Two Distances d and d + 1
Problems of Information Transmission ( IF 0.5 ) Pub Date : 2020-04-16 , DOI: 10.1134/s0032946020010044
P. Boyvalenkov , K. Delchev , D. V. Zinoviev , V. A. Zinoviev

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.

中文翻译:

关于具有两个距离d和d + 1的q元代码

我们考虑恰好有两个距离的q -ary分组码:dd + 1。在线性情况下,我们表明可以通过简单修改线性等距代码来获得所有代码。得出此类代码的最大基数的上限。列出了较小的qn的上下限表。
更新日期:2020-04-16
down
wechat
bug