Algebraic decoding beyond $e_{BCH}$ of some binary cyclic codes, when $e>e_{BCH}$

P.A.H. Bours; J.C.M. Janssen; M.J.M.M. van Asperdt; H.C.A. Tilborg, van

doi:10.1109/18.50396

Algebraic decoding beyond $e_{BCH}$ of some binary cyclic codes, when $e>e_{BCH}$

P.A.H. Bours, J.C.M. Janssen, M.J.M.M. van Asperdt, H.C.A. Tilborg, van

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

16 Citations (Scopus)

Abstract

For a number of binary cyclic codes with e>e BCH, algebraic algorithms are given to find the error locator polynomial. Thus, for these codes more errors can be corrected algebraically than by the Berlekamp-Massey algorithm. In some cases, all error patterns of weight up to e can be decoded; in other cases, only error patterns of weight up to e' with e BCH

Original language	English
Pages (from-to)	214-222
Journal	IEEE Transactions on Information Theory
Volume	36
Issue number	1
DOIs	https://doi.org/10.1109/18.50396
Publication status	Published - 1990

Access to Document

10.1109/18.50396

Cite this

@article{29aa654cb47a4c3f8acdfd42c8215af7,

title = "Algebraic decoding beyond $e_{BCH}$ of some binary cyclic codes, when $e>e_{BCH}$",

abstract = "For a number of binary cyclic codes with e>e BCH, algebraic algorithms are given to find the error locator polynomial. Thus, for these codes more errors can be corrected algebraically than by the Berlekamp-Massey algorithm. In some cases, all error patterns of weight up to e can be decoded; in other cases, only error patterns of weight up to e' with e BCH",

author = "P.A.H. Bours and J.C.M. Janssen and {van Asperdt}, M.J.M.M. and {Tilborg, van}, H.C.A.",

year = "1990",

doi = "10.1109/18.50396",

language = "English",

volume = "36",

pages = "214--222",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "1",

}

TY - JOUR

T1 - Algebraic decoding beyond $e_{BCH}$ of some binary cyclic codes, when $e>e_{BCH}$

AU - Bours, P.A.H.

AU - Janssen, J.C.M.

AU - van Asperdt, M.J.M.M.

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

PY - 1990

Y1 - 1990

N2 - For a number of binary cyclic codes with e>e BCH, algebraic algorithms are given to find the error locator polynomial. Thus, for these codes more errors can be corrected algebraically than by the Berlekamp-Massey algorithm. In some cases, all error patterns of weight up to e can be decoded; in other cases, only error patterns of weight up to e' with e BCH

AB - For a number of binary cyclic codes with e>e BCH, algebraic algorithms are given to find the error locator polynomial. Thus, for these codes more errors can be corrected algebraically than by the Berlekamp-Massey algorithm. In some cases, all error patterns of weight up to e can be decoded; in other cases, only error patterns of weight up to e' with e BCH

U2 - 10.1109/18.50396

DO - 10.1109/18.50396

M3 - Article

SN - 0018-9448

VL - 36

SP - 214

EP - 222

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 1

ER -

Algebraic decoding beyond $e_{BCH}$ of some binary cyclic codes, when $e>e_{BCH}$

Abstract

Access to Document

Fingerprint

Cite this