Fast decoding algorithms for first order Reed-Muller and related codes

Alexey E. Ashikhmin; Simon N. Litsyn

doi:10.1007/bf00124511

Fast decoding algorithms for first order Reed-Muller and related codes

Alexey E. Ashikhmin^*, Simon N. Litsyn

^*Corresponding author for this work

School of Electrical Engineering

Russian Academy of Sciences

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

11 Scopus citations

Abstract

Fast decoding algorithms for short codes based on modifications of maximum likelihood decoding algorithms of first order Reed-Muller codes are described. Only additions-subtractions, comparisons and absolute value calculations are used in the algorithms. Soft and hard decisions maximum likelihood decoding algorithms for first order Reed-Muller and the Nordstrom-Robinson codes with low complexity are proposed.

Original language	English
Pages (from-to)	187-214
Number of pages	28
Journal	Designs, Codes, and Cryptography
Volume	7
Issue number	3
DOIs	https://doi.org/10.1007/bf00124511
State	Published - 1996

Keywords

Decoding algorithms
First order Reed-Muller codes
The Nordstrom-Robinson code

Access to Document

10.1007/bf00124511

Cite this

@article{818e19774e7147989a33044a9572d366,

title = "Fast decoding algorithms for first order Reed-Muller and related codes",

abstract = "Fast decoding algorithms for short codes based on modifications of maximum likelihood decoding algorithms of first order Reed-Muller codes are described. Only additions-subtractions, comparisons and absolute value calculations are used in the algorithms. Soft and hard decisions maximum likelihood decoding algorithms for first order Reed-Muller and the Nordstrom-Robinson codes with low complexity are proposed.",

keywords = "Decoding algorithms, First order Reed-Muller codes, The Nordstrom-Robinson code",

author = "Ashikhmin, {Alexey E.} and Litsyn, {Simon N.}",

year = "1996",

doi = "10.1007/bf00124511",

language = "אנגלית",

volume = "7",

pages = "187--214",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - Fast decoding algorithms for first order Reed-Muller and related codes

AU - Ashikhmin, Alexey E.

AU - Litsyn, Simon N.

PY - 1996

Y1 - 1996

N2 - Fast decoding algorithms for short codes based on modifications of maximum likelihood decoding algorithms of first order Reed-Muller codes are described. Only additions-subtractions, comparisons and absolute value calculations are used in the algorithms. Soft and hard decisions maximum likelihood decoding algorithms for first order Reed-Muller and the Nordstrom-Robinson codes with low complexity are proposed.

AB - Fast decoding algorithms for short codes based on modifications of maximum likelihood decoding algorithms of first order Reed-Muller codes are described. Only additions-subtractions, comparisons and absolute value calculations are used in the algorithms. Soft and hard decisions maximum likelihood decoding algorithms for first order Reed-Muller and the Nordstrom-Robinson codes with low complexity are proposed.

KW - Decoding algorithms

KW - First order Reed-Muller codes

KW - The Nordstrom-Robinson code

UR - http://www.scopus.com/inward/record.url?scp=4043049921&partnerID=8YFLogxK

U2 - 10.1007/bf00124511

DO - 10.1007/bf00124511

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:4043049921

SN - 0925-1022

VL - 7

SP - 187

EP - 214

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

IS - 3

ER -

Fast decoding algorithms for first order Reed-Muller and related codes

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this