Error-locating pairs for cyclic codes

I.M. Duursma; R. Kötter

doi:10.1109/18.335964

Error-locating pairs for cyclic codes

I.M. Duursma, R. Kötter

Mathematics and Computer Science

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

44 Citations (Scopus)

1 Downloads (Pure)

Abstract

A general decoding method for linear codes is investigated for cyclic codes. The decoding consists of solving two systems of linear equations. All but four binary cyclic codes of length less than 63 can so be decoded up to their actual distance. A new family of codes is given for which the decoding needs only O(n2) operations.

Original language	English
Pages (from-to)	1108-1121
Journal	IEEE Transactions on Information Theory
Volume	40
Issue number	4
DOIs	https://doi.org/10.1109/18.335964
Publication status	Published - 1994

Access to Document

10.1109/18.335964

Cite this

@article{9729083fe0f44270a59a88dc504fc8ed,

title = "Error-locating pairs for cyclic codes",

abstract = "A general decoding method for linear codes is investigated for cyclic codes. The decoding consists of solving two systems of linear equations. All but four binary cyclic codes of length less than 63 can so be decoded up to their actual distance. A new family of codes is given for which the decoding needs only O(n2) operations.",

author = "I.M. Duursma and R. K{\"o}tter",

year = "1994",

doi = "10.1109/18.335964",

language = "English",

volume = "40",

pages = "1108--1121",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "4",

}

TY - JOUR

T1 - Error-locating pairs for cyclic codes

AU - Duursma, I.M.

AU - Kötter, R.

PY - 1994

Y1 - 1994

N2 - A general decoding method for linear codes is investigated for cyclic codes. The decoding consists of solving two systems of linear equations. All but four binary cyclic codes of length less than 63 can so be decoded up to their actual distance. A new family of codes is given for which the decoding needs only O(n2) operations.

AB - A general decoding method for linear codes is investigated for cyclic codes. The decoding consists of solving two systems of linear equations. All but four binary cyclic codes of length less than 63 can so be decoded up to their actual distance. A new family of codes is given for which the decoding needs only O(n2) operations.

U2 - 10.1109/18.335964

DO - 10.1109/18.335964

M3 - Article

SN - 0018-9448

VL - 40

SP - 1108

EP - 1121

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 4

ER -

Error-locating pairs for cyclic codes

Abstract

Access to Document

Fingerprint

Cite this