Fast bounded-distance decoding of the Nordstrom-Robinson code

F.W. Sun; H.C.A. Tilborg, van

Fast bounded-distance decoding of the Nordstrom-Robinson code

Discrete Mathematics

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

Abstract

Based on the two-level squaring construction of the Reed-Muller code, a bounded-distance decoding algorithm for the Nordstrom-Robinson code is given. This algorithm involves 199 real operations, which is less than one half of the computational complexity of the known maximum-likelihood decoding algorithms for this code. The algorithm also has exactly the same effective error coefficient as the maximum-likelihood decoding, so that its performance is only degraded by a negligible amount.

Original language	English
Title of host publication	Communications and cryptography : two sides of the same tapestry (Symposium in honor of James Massey on his 60th birthday, Ascona, Switzerland, February 10-14, 1994)
Editors	R.E. Blahut, xx et al.
Place of Publication	Dordrecht
Publisher	Kluwer Academic Publishers
Pages	391-398
ISBN (Print)	0-7923-9469-0
Publication status	Published - 1994

Publication series

Name	Kluwer international series in engineering and computer science
ISSN (Print)	0893-3405

Cite this

Sun, F. W., & Tilborg, van, H. C. A. (1994). Fast bounded-distance decoding of the Nordstrom-Robinson code. In R. E. Blahut, & X. et al. (Eds.), Communications and cryptography : two sides of the same tapestry (Symposium in honor of James Massey on his 60th birthday, Ascona, Switzerland, February 10-14, 1994) (pp. 391-398). (Kluwer international series in engineering and computer science). Kluwer Academic Publishers.

Sun, F.W. ; Tilborg, van, H.C.A. / Fast bounded-distance decoding of the Nordstrom-Robinson code. Communications and cryptography : two sides of the same tapestry (Symposium in honor of James Massey on his 60th birthday, Ascona, Switzerland, February 10-14, 1994). editor / R.E. Blahut ; xx et al. Dordrecht : Kluwer Academic Publishers, 1994. pp. 391-398 (Kluwer international series in engineering and computer science).

@inbook{4dbc96d3f55146faa9760c2a695f7ba4,

title = "Fast bounded-distance decoding of the Nordstrom-Robinson code",

abstract = "Based on the two-level squaring construction of the Reed-Muller code, a bounded-distance decoding algorithm for the Nordstrom-Robinson code is given. This algorithm involves 199 real operations, which is less than one half of the computational complexity of the known maximum-likelihood decoding algorithms for this code. The algorithm also has exactly the same effective error coefficient as the maximum-likelihood decoding, so that its performance is only degraded by a negligible amount.",

author = "F.W. Sun and {Tilborg, van}, H.C.A.",

year = "1994",

language = "English",

isbn = "0-7923-9469-0",

series = "Kluwer international series in engineering and computer science",

publisher = "Kluwer Academic Publishers",

pages = "391--398",

editor = "R.E. Blahut and {et al.}, xx",

booktitle = "Communications and cryptography : two sides of the same tapestry (Symposium in honor of James Massey on his 60th birthday, Ascona, Switzerland, February 10-14, 1994)",

address = "Netherlands",

}

Sun, FW & Tilborg, van, HCA 1994, Fast bounded-distance decoding of the Nordstrom-Robinson code. in RE Blahut & X et al. (eds), Communications and cryptography : two sides of the same tapestry (Symposium in honor of James Massey on his 60th birthday, Ascona, Switzerland, February 10-14, 1994). Kluwer international series in engineering and computer science, Kluwer Academic Publishers, Dordrecht, pp. 391-398.

Fast bounded-distance decoding of the Nordstrom-Robinson code. / Sun, F.W.; Tilborg, van, H.C.A.

Communications and cryptography : two sides of the same tapestry (Symposium in honor of James Massey on his 60th birthday, Ascona, Switzerland, February 10-14, 1994). ed. / R.E. Blahut; xx et al. Dordrecht : Kluwer Academic Publishers, 1994. p. 391-398 (Kluwer international series in engineering and computer science).

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

TY - CHAP

T1 - Fast bounded-distance decoding of the Nordstrom-Robinson code

AU - Sun, F.W.

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

PY - 1994

Y1 - 1994

N2 - Based on the two-level squaring construction of the Reed-Muller code, a bounded-distance decoding algorithm for the Nordstrom-Robinson code is given. This algorithm involves 199 real operations, which is less than one half of the computational complexity of the known maximum-likelihood decoding algorithms for this code. The algorithm also has exactly the same effective error coefficient as the maximum-likelihood decoding, so that its performance is only degraded by a negligible amount.

AB - Based on the two-level squaring construction of the Reed-Muller code, a bounded-distance decoding algorithm for the Nordstrom-Robinson code is given. This algorithm involves 199 real operations, which is less than one half of the computational complexity of the known maximum-likelihood decoding algorithms for this code. The algorithm also has exactly the same effective error coefficient as the maximum-likelihood decoding, so that its performance is only degraded by a negligible amount.

M3 - Chapter

SN - 0-7923-9469-0

T3 - Kluwer international series in engineering and computer science

SP - 391

EP - 398

BT - Communications and cryptography : two sides of the same tapestry (Symposium in honor of James Massey on his 60th birthday, Ascona, Switzerland, February 10-14, 1994)

A2 - Blahut, R.E.

A2 - et al., xx

PB - Kluwer Academic Publishers

CY - Dordrecht

ER -

Sun FW, Tilborg, van HCA. Fast bounded-distance decoding of the Nordstrom-Robinson code. In Blahut RE, et al. X, editors, Communications and cryptography : two sides of the same tapestry (Symposium in honor of James Massey on his 60th birthday, Ascona, Switzerland, February 10-14, 1994). Dordrecht: Kluwer Academic Publishers. 1994. p. 391-398. (Kluwer international series in engineering and computer science).

Fast bounded-distance decoding of the Nordstrom-Robinson code

Abstract

Publication series

Fingerprint

Cite this