当前位置: X-MOL 学术Adv. Math. Commun. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
New bounds on the minimum distance of cyclic codes
Advances in Mathematics of Communications ( IF 0.9 ) Pub Date : 2019-11-20 , DOI: 10.3934/amc.2020038
San Ling , , Buket Özkaya

Two bounds on the minimum distance of cyclic codes are proposed. The first one generalizes the Roos bound by embedding the given cyclic code into a cyclic product code. The second bound also uses a second cyclic code, namely the non-zero-locator code, but is not directly related to cyclic product codes and it generalizes a special case of the Roos bound.

中文翻译:

循环码最小距离的新界限

提出了循环码最小距离的两个界限。第一个通过将给定的循环代码嵌入到循环乘积代码中来概括Roos绑定。第二界限还使用第二循环码,即非零定位器码,但与循环乘积码不直接相关,并且概括了Roos界限的一种特殊情况。
更新日期:2019-11-20
down
wechat
bug