当前位置: X-MOL 学术Cryptogr. Commun. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Some new bounds on LCD codes over finite fields
Cryptography and Communications ( IF 1.4 ) Pub Date : 2020-01-09 , DOI: 10.1007/s12095-019-00417-y
Binbin Pang , Shixin Zhu , Xiaoshan Kai

In this paper, we show that LCD codes are not equivalent to non-LCD codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD(n,2) over \(\mathbb {F}_{3}\) and \(\mathbb {F}_{4}\), where LD(n,2) := max{dthereexsitsan [n,2, d] LCD\( code~ over~ \mathbb {F}_{q}\}\). We study the bound of LCD codes over \(\mathbb {F}_{q}\) and generalize a conjecture proposed by Galvez et al. about the minimum distance of binary LCD codes.

中文翻译:

LCD代码在有限域上的一些新界限

在本文中,我们证明了在有限的小范围内,LCD代码不等同于非LCD代码。获得了二进制最佳LCD代码的枚举。我们也得到LD的精确值(ñ,2)在\(\ mathbb {F} _ {3} \)\(\ mathbb {F} _ {4} \) ,其中LD(ñ,2): =一个X { d |ħ Ë ř Ë Ë X小号小号一个ñ [ ñ,2,d ] LCD \(代码〜以上〜\ mathbb {F} _ {q} \} \) 。我们研究LCD代码的边界\(\ mathbb {F} _ {q} \)并推广由Galvez等人提出的猜想。关于二进制LCD代码的最小距离。
更新日期:2020-01-09
down
wechat
bug