On combining Chase-2 and GMD decoding algorithms for nonbinary block codes

In this letter, a class of algorithms that combines Chase-2 and GMD (generalized minimum distance) decoding algorithms is presented for nonbinary block codes. This approach provides additional trade-offs between error performance and decoding complexity. Reduced-complexity versions of the algorithms...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 5; no. 5; pp. 209 - 211
Main Authors: Tang, H., Liu, Y., Fossorier, M., Lin, S.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.05.2001
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Applied sciences
Binary codes
Block codes
Coding, codes
Communication channels
Complexity
Computer simulation
Decoding
Errors
Exact sciences and technology
Hamming distance
Information, signal and communications theory
Large scale integration
Logic
NASA
Particle measurements
Signal and communications theory
Telecommunications and information theory
Testing
Tradeoffs
Performance evaluation
Block code
Error probability
Non binary code
Signal processing
Decoding
Algorithm
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this letter, a class of algorithms that combines Chase-2 and GMD (generalized minimum distance) decoding algorithms is presented for nonbinary block codes. This approach provides additional trade-offs between error performance and decoding complexity. Reduced-complexity versions of the algorithms with practical interests are then provided and simulated.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1089-7798
1558-2558
DOI:10.1109/4234.922762