From ds-Bounds for Cyclic Codes to True Minimum Distance for Abelian Codes
IEEE Transactions on Information Theory(2019)
摘要
In this paper, we develop a technique to extend any bound for the minimum distance of cyclic codes constructed from its defining sets (ds-bounds) to Abelian (or multivariate) codes through the notion of
${\mathbb B}$
-apparent distance. We also study conditions for an Abelian code to verify that its
${\mathbb B}$
-apparent distance reaches its (true) minimum distance. Then, we construct some codes as an application.
更多查看译文
关键词
Decoding,Algebra,Zirconium,Zinc,Encoding,Discrete Fourier transforms
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要