Open AccessDecoding Reed- Muller Codes by Using Hadamard Matrices
Author(s) -
Mohammed Ali Morad
Publication year - 2009
Publication title -
mağallaẗ baġdād li-l-ʿulūm
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.167
H-Index - 6
eISSN - 2411-7986
pISSN - 2078-8665
DOI - 10.21123/bsj.6.4.811-815
Subject(s) - hadamard transform , code word , reed–muller code , decoding methods , hamming code , parity check matrix , mathematics , block code , hamming distance , list decoding , encoding (memory) , reed–solomon error correction , computer science , discrete mathematics , algorithm , combinatorics , linear code , arithmetic , concatenated error correction code , artificial intelligence , mathematical analysis
This paper discusses the problem of decoding codeword in Reed- Muller Codes. We will use the Hadamard matrices as a method to decode codeword in Reed- Muller codes.In addition Reed- Muller Codes are defined and encoding matrices are discussed. Finally, a method of decoding is explained and an example is given to clarify this method, as well as, this method is compared with the classical method which is called Hamming distance.