TY - JOUR
T1 - On Maximum Likelihood Soft Decoding of Some Binary Self-Dual Codes
AU - Ran, Moshe
AU - Snyders, Jakov
N1 - Funding Information:
Paper approved by the Editor for Communication Theory of the IEEE Communications Society. This work was supported in part by the Basic Research Foundation administered by the Israel Academy of Sciences and Humanities. The authors are with the Department of Electrical Engineering-Systems, Tel-Aviv University, Ramat Aviv 69978, Israel. IEEE Log Number 9208027.
PY - 1993/3
Y1 - 1993/3
N2 - Efficient algorithms are derived for maximum like-lihood soft-decision decoding of some binary self-dual codes, A family of easily decodable self-dual codes is derived by modifying a known [24, 12, 4] codeF24, whose weight distribution resembles the weight distribution of the [24, 12, 8] Golay code G24. The maximum likelihood decoding of F21is accomplished by only 227 real additions, compared to 651 required for G21, yet the error rates of the two decoders are similar for moderate noise conditions.
AB - Efficient algorithms are derived for maximum like-lihood soft-decision decoding of some binary self-dual codes, A family of easily decodable self-dual codes is derived by modifying a known [24, 12, 4] codeF24, whose weight distribution resembles the weight distribution of the [24, 12, 8] Golay code G24. The maximum likelihood decoding of F21is accomplished by only 227 real additions, compared to 651 required for G21, yet the error rates of the two decoders are similar for moderate noise conditions.
UR - http://www.scopus.com/inward/record.url?scp=0027561090&partnerID=8YFLogxK
U2 - 10.1109/26.221070
DO - 10.1109/26.221070
M3 - מאמר
AN - SCOPUS:0027561090
VL - 41
SP - 439
EP - 443
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
SN - 1558-0857
IS - 3
ER -