Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes

被引：0

作者：

Zeh, Alexander ^{[1
]}

Wachter-Zeh, Antonia ^{[1
]}

Gadouleau, Maximilien ^{[2
]}

Bezzateev, Sergey ^{[3
]}

机构：

[1] Univ Ulm, Inst Commun Engn, D-89069 Ulm, Germany

[2] Univ Durham, Sch Engn & Comp Sci ECS, Durham, England

[3] Saint Petersburg State Univ, Airspace Instrumentat, St Petersburg, Russia

来源：

2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) | 2013年

关键词：

Cyclic Code; Cyclic Product Code; Bound on the Minimum Distance; Efficient Decoding;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Two generalizations of the Hartmann-Tzeng ( HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique decoding up to this bound is always possible and outline a quadratic-time syndrome-based error decoding algorithm. The second bound is stronger and the proof is more involved. Our technique of embedding the code into a cyclic product code can be applied to other bounds, too and therefore generalizes them.

引用

页码：126 / +

页数：2

共 18 条

[1] CASCADE DECODING OF CYCLIC PRODUCT CODES [J].