On the Maximum Burst-Correcting Capability of Cyclic Hsu-Kasami-Chien Codes

被引：2

作者：

Zhou, Wei ^{[1
]}

机构：

[1] Lund Univ, Dept Elect & Informat Technol, S-22100 Lund, Sweden

来源：

IEEE COMMUNICATIONS LETTERS | 2017年 / 21卷 / 11期

关键词：

Burst-correcting code; cyclic code; Hsu-kasami-chien code;

D O I：

10.1109/LCOMM.2017.2739725

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

Hsu-Kasami-Chien (HKC) codes are a class of cyclic codes that can correct either burst or random errors. This letter studies the maximum burst-correcting capability of HKC codes. A necessary and sufficient condition for a b-burst-correcting cyclic HKC code is given and simplified as a generalized one for Fire codes. An upper bound on the burst-correcting capability of HKC codes is derived, which improves upon a previous bound. Explicit examples of HKC codes are presented. A design guideline for constructing HKC codes with given burst-error and random-error correcting capabilities is presented.

引用

页码：2352 / 2355

页数：4

共 8 条

[1] ON THE EXISTENCE OF OPTIMUM CYCLIC BURST-CORRECTING CODES [J].

ABDELGHAFFAR, KAS ;

MCELIECE, RJ ;

ODLYZKO, AM ;

VANTILBORG, HCA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (06) :768-775

[2]

Fire P., 1959, TECH REP

[3] ERROR-CORRECTING CODES FOR A COMPOUND CHANNEL [J].

HSU, HT ;

KASAMI, T ;

CHIEN, RT .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1968, 14 (01) :135-+

[4]

Lin S., 2004, ERROR CORRECTING COD, V2nd

[5]

McEliece R. J., 2002, THEORY INFORM CODING

[6] CODES FOR THE CORRECTION OF CLUSTERED ERRORS [J].

REIGER, SH .

IRE TRANSACTIONS ON INFORMATION THEORY, 1960, 6 (01) :16-21

[7] On the Maximum True Burst-Correcting Capability of Fire Codes [J].

Zhou, Wei ;

Lin, Shu ;

Abdel-Ghaffar, Khaled A. S. .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (10) :5323-5342

[8]

ZHOU WP, 2014, PROC INF THEORY APPL, V75, P1

← 1 →