Fast algebraic decoding of the (17, 9, 5) quadratic residue code

A fast algebraic decoding algorithm is proposed to correct all patterns of two or fewer errors in the binary (17, 9, 5) quadratic residue (QR) code. Computer simulations show that the average decoding time of the proposed decoding algorithm is about 2.88 times less execution time than the D3 algebra...

Full description

Saved in:
Bibliographic Details
Published in:2012 2nd International Conference on Consumer Electronics, Communications and Networks pp. 1812 - 1815
Main Author: Hung-Peng Lee
Format: Conference Proceeding
Language:English
Published: IEEE 01.04.2012
Subjects:
algebraic decoding algorithm
Algorithm design and analysis
Decoding
Encoding
error pattern
Polynomials
quadratic residue code
Silicon
Software algorithms
syndrome
Systematics
ISBN:9781457714146, 1457714140
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A fast algebraic decoding algorithm is proposed to correct all patterns of two or fewer errors in the binary (17, 9, 5) quadratic residue (QR) code. Computer simulations show that the average decoding time of the proposed decoding algorithm is about 2.88 times less execution time than the D3 algebraic decoding algorithm of Chang et al.
ISBN:9781457714146
1457714140
DOI:10.1109/CECNet.2012.6201457