Theoretical analysis of the error correction performance of majority-logic-like vector symbol codes
JM Chung, JJ Metzner - IEEE Transactions on Communications, 2001 - ieeexplore.ieee.org
The average codeword success probability of the majority-logic-like vector symbol (MLLVS)
code is derived for the following two cases:(1) single-pass decoding and (2) upper bound of
multipass decoding, when the received word has more than (J-1) symbol errors, where J is
the number of check sum equations. The MLLVS code has been simulated by Metzner
(1996), and it was concluded that the average error correcting capability of MLLVS codes
exceed the decoding capability of Reed-Solomon codes, but is achieved with less …
code is derived for the following two cases:(1) single-pass decoding and (2) upper bound of
multipass decoding, when the received word has more than (J-1) symbol errors, where J is
the number of check sum equations. The MLLVS code has been simulated by Metzner
(1996), and it was concluded that the average error correcting capability of MLLVS codes
exceed the decoding capability of Reed-Solomon codes, but is achieved with less …
[BOOK][B] Analysis of the error correction performance of majority-logic-like vector symbol codes and applications in diversity combining systems
JM Chung - 1999 - search.proquest.com
In this dissertation, the average code word success probability of the majority-logic-like
vector symbol (MLLVS) code is derived, and the performance of macrodiversity combining
over concatenated BCH inner codes and MLLVS codes within lognormally shadowed
Rayleigh fading channels are analyzed.
vector symbol (MLLVS) code is derived, and the performance of macrodiversity combining
over concatenated BCH inner codes and MLLVS codes within lognormally shadowed
Rayleigh fading channels are analyzed.
Showing the best results for this search. See all results