On joint ML detection and decoding for linear block codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 275-

  Vikalo, Haris ^a   Hassibi, Babak ^a  

^a California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA COMMUNICATION SYSTEMS; DECODING; ERROR CORRECTION; MAXIMUM LIKELIHOOD ESTIMATION; PERTURBATION TECHNIQUES; POLYNOMIALS; RANDOM PROCESSES; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE; MAXIMUM LIKELIHOOD DETECTION; MULTIPLE INPUT MULTIPLE OUTPUT SYSTEMS;

BLOCK CODES;

EID: 0141938895     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228290     Document Type: Conference Paper

References (1)

1. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Mathematics of Computation, vol. 44, pp. 463-471, April 1985.