Closest Coset Decoding of | u | u + v | Codes

IEEE Journal on Selected Areas in Communications

Volumn 7, Issue 6, 1989, Pages 982-988

  Hemmati, Farhad ^a  

^a Image Processing Department   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DIGITAL COMMUNICATION SYSTEMS; PROBABILITY;

BER PERFORMANCE; CLOSEST COSET DECODING; MAXIMUM LIKELIHOOD DECODER (MLD); REED-MULLER CODES; SET PARTITIONING; SUBOPTIMUM DECODING SCHEME;

CODES, SYMBOLIC;

EID: 0024717378     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.29620     Document Type: Article

References (5)

1. J.K. Wolf, “Efficient maximum likelihood decoding of linear block codes using a trellis,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 76–80, Jan. 1978.
2. J.H. Conway and N.J.A. Sloane, “Soft decoding techniques for codes and lattices, including the Golay and the Leech lattice,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 41–50, Jan. 1986.
3. G.D. Forney, Jr., “Coset-Codes I: Binary codes and lattices,” IEEE Commun. Theory Workshop, Palm Springs, CA, Apr. 1986.
4. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes. New York: North Holland, 1977.
5. J.G. Proakis, Digital Communication. New York: McGraw Hill, 1983.