Reed-Muller Codec Simulation Performance
The approach to error correction coding taken by modern digital communication systems started in the late 1940’s with the ground breaking work of Shannon, Hamming and Golay. Reed- Muller (RM) codes were an important step beyond the Hamming and Golay codes because they allowed more flexibility in...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Science Publications
2008
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/23642/1/The_approach_to_error_correction_coding_taken_by_modern_digital_communication_systems.pdf http://irep.iium.edu.my/23642/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.iium.irep.23642 |
---|---|
record_format |
dspace |
spelling |
my.iium.irep.236422020-12-08T06:12:04Z http://irep.iium.edu.my/23642/ Reed-Muller Codec Simulation Performance Khalifa, Othman Omran Hassan Abdalla Hashim, Aisha Suriyana, N. Zawana, Saidah Hameed, Shihab A. Q Science (General) The approach to error correction coding taken by modern digital communication systems started in the late 1940’s with the ground breaking work of Shannon, Hamming and Golay. Reed- Muller (RM) codes were an important step beyond the Hamming and Golay codes because they allowed more flexibility in the size of the code word and the number of correctable errors per code word. Whereas the Hamming and Golay codes were specific codes with particular values for q; n; k; and t, the RM codes were a class of binary codes with a wide range of allowable design parameters. Binary Reed-Muller codes are among the most prominent families of codes in coding theory. They have been extensively studied and employed for practical applications. In this research, the performance simulation of Reed-Muller Codec was presented. An introduction on Reed-Muller codes, were introduced that consists of defining the key terms and operation used with the binary numbers. Reed-Muller codes were defined and encoding matrices were discussed. The decoding process was given and some examples were demonstrated to clarify the method. The results and the performance of Reed-Muller encoding were presented and the messages been encoded using the defined matrices were shown. The simulation of the decoding part also been shown. The performance of Reed-Muller codes were then analyzed in terms of its code rate, code length and minimum Hamming distance. The analysis that performed also successfully examines the relationship between the parameters of Reed- Muller coding. The decoding part of the Reed-Muller codes can detect one error and correct it as shown in the examples. Science Publications 2008 Article PeerReviewed application/pdf en http://irep.iium.edu.my/23642/1/The_approach_to_error_correction_coding_taken_by_modern_digital_communication_systems.pdf Khalifa, Othman Omran and Hassan Abdalla Hashim, Aisha and Suriyana, N. and Zawana, Saidah and Hameed, Shihab A. (2008) Reed-Muller Codec Simulation Performance. Journal of Computer Science, 4 (10). pp. 792-798. ISSN 1549-3636 |
institution |
Universiti Islam Antarabangsa Malaysia |
building |
IIUM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
International Islamic University Malaysia |
content_source |
IIUM Repository (IREP) |
url_provider |
http://irep.iium.edu.my/ |
language |
English |
topic |
Q Science (General) |
spellingShingle |
Q Science (General) Khalifa, Othman Omran Hassan Abdalla Hashim, Aisha Suriyana, N. Zawana, Saidah Hameed, Shihab A. Reed-Muller Codec Simulation Performance |
description |
The approach to error correction coding taken by modern digital communication systems
started in the late 1940’s with the ground breaking work of Shannon, Hamming and Golay. Reed-
Muller (RM) codes were an important step beyond the Hamming and Golay codes because they
allowed more flexibility in the size of the code word and the number of correctable errors per code
word. Whereas the Hamming and Golay codes were specific codes with particular values for q; n; k;
and t, the RM codes were a class of binary codes with a wide range of allowable design parameters.
Binary Reed-Muller codes are among the most prominent families of codes in coding theory. They
have been extensively studied and employed for practical applications. In this research, the
performance simulation of Reed-Muller Codec was presented. An introduction on Reed-Muller codes,
were introduced that consists of defining the key terms and operation used with the binary numbers.
Reed-Muller codes were defined and encoding matrices were discussed. The decoding process was
given and some examples were demonstrated to clarify the method. The results and the performance of
Reed-Muller encoding were presented and the messages been encoded using the defined matrices were
shown. The simulation of the decoding part also been shown. The performance of Reed-Muller codes
were then analyzed in terms of its code rate, code length and minimum Hamming distance. The
analysis that performed also successfully examines the relationship between the parameters of Reed-
Muller coding. The decoding part of the Reed-Muller codes can detect one error and correct it as
shown in the examples. |
format |
Article |
author |
Khalifa, Othman Omran Hassan Abdalla Hashim, Aisha Suriyana, N. Zawana, Saidah Hameed, Shihab A. |
author_facet |
Khalifa, Othman Omran Hassan Abdalla Hashim, Aisha Suriyana, N. Zawana, Saidah Hameed, Shihab A. |
author_sort |
Khalifa, Othman Omran |
title |
Reed-Muller Codec Simulation Performance |
title_short |
Reed-Muller Codec Simulation Performance |
title_full |
Reed-Muller Codec Simulation Performance |
title_fullStr |
Reed-Muller Codec Simulation Performance |
title_full_unstemmed |
Reed-Muller Codec Simulation Performance |
title_sort |
reed-muller codec simulation performance |
publisher |
Science Publications |
publishDate |
2008 |
url |
http://irep.iium.edu.my/23642/1/The_approach_to_error_correction_coding_taken_by_modern_digital_communication_systems.pdf http://irep.iium.edu.my/23642/ |
_version_ |
1685578512835018752 |
score |
13.211869 |