The complexity of hard-decision decoding of linear codes

A. Barg; E. Krouk; H. C.A. Van Tilborg

doi:10.1109/ISIT.1997.613259

The complexity of hard-decision decoding of linear codes

A. Barg
, E. Krouk
, H. C.A. Van Tilborg

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

3 Citations (Scopus)

Abstract

We study a general method of minimum distance decoding of linear codes that instead of decoding the original code recovers the transmitted codeword by a number of decodings of shortened codes. We present an implementation of this method whose complexity for long linear codes has the smallest known value for any code rate R, 0<R<1.

Original language	English
Title of host publication	Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Pages	331
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.1997.613259
Publication status	Published - 1997
Event	1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany Duration: 29 Jun 1997 → 4 Jul 1997

Conference

Conference	1997 IEEE International Symposium on Information Theory, ISIT 1997
Country/Territory	Germany
City	Ulm
Period	29/06/97 → 4/07/97
Other	Proc. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, 29 June - 2 July 1997

Access to Document

10.1109/ISIT.1997.613259

Cite this

@inproceedings{6b153a8db948415f89d2592c40721481,

title = "The complexity of hard-decision decoding of linear codes",

abstract = "We study a general method of minimum distance decoding of linear codes that instead of decoding the original code recovers the transmitted codeword by a number of decodings of shortened codes. We present an implementation of this method whose complexity for long linear codes has the smallest known value for any code rate R, 0",

author = "A. Barg and E. Krouk and \{Van Tilborg\}, \{H. C.A.\}",

year = "1997",

doi = "10.1109/ISIT.1997.613259",

language = "English",

isbn = "0780339568",

pages = "331",

booktitle = "Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997",

note = "1997 IEEE International Symposium on Information Theory, ISIT 1997 ; Conference date: 29-06-1997 Through 04-07-1997",

}

TY - GEN

T1 - The complexity of hard-decision decoding of linear codes

AU - Barg, A.

AU - Krouk, E.

AU - Van Tilborg, H. C.A.

PY - 1997

Y1 - 1997

N2 - We study a general method of minimum distance decoding of linear codes that instead of decoding the original code recovers the transmitted codeword by a number of decodings of shortened codes. We present an implementation of this method whose complexity for long linear codes has the smallest known value for any code rate R, 0

AB - We study a general method of minimum distance decoding of linear codes that instead of decoding the original code recovers the transmitted codeword by a number of decodings of shortened codes. We present an implementation of this method whose complexity for long linear codes has the smallest known value for any code rate R, 0

UR - https://www.scopus.com/pages/publications/0030685371

U2 - 10.1109/ISIT.1997.613259

DO - 10.1109/ISIT.1997.613259

M3 - Conference contribution

AN - SCOPUS:0030685371

SN - 0780339568

SN - 9780780339569

SP - 331

BT - Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997

T2 - 1997 IEEE International Symposium on Information Theory, ISIT 1997

Y2 - 29 June 1997 through 4 July 1997

ER -

The complexity of hard-decision decoding of linear codes

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this