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

Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

Abstract

Hsu–Kasami–Chien (HKC) are a class of cyclic codes that can correct either burst or random errors. This paper 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 burstcorrecting 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.

Detaljer

Författare
Enheter & grupper
Forskningsområden

Ämnesklassifikation (UKÄ) – OBLIGATORISK

  • Kommunikationssystem

Nyckelord

Originalspråkengelska
TidskriftIEEE Communications Letters
Utgivningsnummer99
StatusPublished - 2017 aug 13
PublikationskategoriForskning
Peer review utfördJa