Two observations concerning optimum cyclic burst-correcting codes

P.W. Heijnen; H.C.A. Tilborg, van

doi:10.1016/S0012-365X(97)00083-6

Two observations concerning optimum cyclic burst-correcting codes

P.W. Heijnen
, H.C.A. Tilborg, van

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

In (Adbel-Ghaffar et al., 1986) it is shown that for each integer b1 infinitely many optimum cyclic b-burst correcting codes exist. In the first part of this correspondence the parameters of all optimum cyclic four- and five-burst-correcting codes are given explicitly. Tables are included. In (van Tilborg, 1993) a very brief indication of the decoding of optimum cyclic burst-correcting codes is given. In the second part of this correspondence the decoding algorithm is analyzed in further detail. It turns out that the bulk of the decoding steps can be performed completely in parallel.

Original language	English
Pages (from-to)	111-120
Number of pages	10
Journal	Discrete Mathematics
Volume	184
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(97)00083-6
Publication status	Published - 1998

Access to Document

10.1016/S0012-365X(97)00083-6

Cite this

@article{b78144e481cc4baabaac4b932abb6bc5,

title = "Two observations concerning optimum cyclic burst-correcting codes",

abstract = "In (Adbel-Ghaffar et al., 1986) it is shown that for each integer b1 infinitely many optimum cyclic b-burst correcting codes exist. In the first part of this correspondence the parameters of all optimum cyclic four- and five-burst-correcting codes are given explicitly. Tables are included. In (van Tilborg, 1993) a very brief indication of the decoding of optimum cyclic burst-correcting codes is given. In the second part of this correspondence the decoding algorithm is analyzed in further detail. It turns out that the bulk of the decoding steps can be performed completely in parallel.",

author = "P.W. Heijnen and \{Tilborg, van\}, H.C.A.",

year = "1998",

doi = "10.1016/S0012-365X(97)00083-6",

language = "English",

volume = "184",

pages = "111--120",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - Two observations concerning optimum cyclic burst-correcting codes

AU - Heijnen, P.W.

AU - Tilborg, van, H.C.A.

PY - 1998

Y1 - 1998

N2 - In (Adbel-Ghaffar et al., 1986) it is shown that for each integer b1 infinitely many optimum cyclic b-burst correcting codes exist. In the first part of this correspondence the parameters of all optimum cyclic four- and five-burst-correcting codes are given explicitly. Tables are included. In (van Tilborg, 1993) a very brief indication of the decoding of optimum cyclic burst-correcting codes is given. In the second part of this correspondence the decoding algorithm is analyzed in further detail. It turns out that the bulk of the decoding steps can be performed completely in parallel.

AB - In (Adbel-Ghaffar et al., 1986) it is shown that for each integer b1 infinitely many optimum cyclic b-burst correcting codes exist. In the first part of this correspondence the parameters of all optimum cyclic four- and five-burst-correcting codes are given explicitly. Tables are included. In (van Tilborg, 1993) a very brief indication of the decoding of optimum cyclic burst-correcting codes is given. In the second part of this correspondence the decoding algorithm is analyzed in further detail. It turns out that the bulk of the decoding steps can be performed completely in parallel.

U2 - 10.1016/S0012-365X(97)00083-6

DO - 10.1016/S0012-365X(97)00083-6

M3 - Article

SN - 0012-365X

VL - 184

SP - 111

EP - 120

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Two observations concerning optimum cyclic burst-correcting codes

Abstract

Access to Document

Fingerprint

Cite this