On Improved Algorithms of the Proposed Lower Bound Including Well-Known Bounds for Cyclic Codes

被引：0

作者：

Kaida, Takayasu ^{[1
]}

Zheng, Junru ^{[2
]}

机构：

[1] Kinki Univ, Fac Humanity Oriented Sci & Engn, Iizuka, Fukuoka 8208555, Japan

[2] Kyushu Womens Univ, Fac Hunam, Fukuoka 8078586, Japan

来源：

2012 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2012) | 2012年

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

It is shown that the proposed lower bound by the authors in 2010 is greater than or equal to the BCH bound for any cyclic codes. Discussion of relationship between the proposed bound and the Hartmann-Zeng bound is also given. For these discussions three improved algorithms from the authors' algorithm are described.

引用

页码：446 / 449

页数：4

共 13 条

[1]

[Anonymous], 1978, The Theory of Error-Correcting Codes

[2]

Betti E., 2007, BCRI CGC PREPRINT 20

[3]

Gheng J, 2007, PROCEEDINGS OF 2007 INTERNATIONAL WORKSHOP ON SIGNAL DESIGN AND ITS APPLICATIONS IN COMMUNICATIONS, P114

[4] GENERALIZATIONS OF BCH BOUND [J].

HARTMANN, CR ;

TZENG, KK .

INFORMATION AND CONTROL, 1972, 20 (05) :489-&

[5]

Junru Zheng, 2010, 2010 International Symposium On Information Theory & Its Applications (ISITA 2010), P846, DOI 10.1109/ISITA.2010.5649592

[6]

Kaida T., 2008, P 2008 INT S INF THE, P395

[7]

Pellikaan R, 1996, ARITHMETIC, GEOMETRY AND CODING THEORY, P155

[8]

Peterson W.W., 1972, Error-correcting codes, V2d

[9]

Ponchino F., 2003, BCRI CGC PREPRINT 20

[10] ON THE MINIMUM DISTANCE OF CYCLIC CODES [J].

VANLINT, JH ;

WILSON, RM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (01) :23-40

← 1 2 →