Title :
On maximum likelihood soft decoding of some binary self dual codes
Author :
Ran, Moshe ; Snyders, Jakov
Author_Institution :
Tel Aviv Univ., Israel
Abstract :
The authors present and compare the performance of maximum likelihood (ML) soft decoding algorithms for binary linear self-dual (SD) codes. The codes considered have a minimum distance of 4, but due to their different weight distributions they differ in their coding gain. Remarkably, there is a code, denoted F24, which has a decoder nearly 4 times faster than the fastest published decoder [6] for the (24,12,8) Golay code. Nontheless, these two codes have almost equal coding gains. Simulation results are given to compare between the codes. An analytical discussion of the results appears in an Appendix
Keywords :
binary sequences; codes; decoding; encoding; Golay code; binary self dual codes; coding gain; computational complexity; maximum likelihood soft decoding; minimum distance; simulation results; weight distributions; Additive white noise; Binary codes; Computational complexity; Maximum likelihood decoding; Parity check codes; Performance gain; Polynomials; Radio access networks; Search methods; Signal to noise ratio;
Conference_Titel :
Electrical and Electronics Engineers in Israel, 1991. Proceedings., 17th Convention of
Conference_Location :
Tel Aviv
Print_ISBN :
0-87942-678-0
DOI :
10.1109/EEIS.1991.217739
