Random codes: Minimum distances and error exponents

IEEE Transactions on Information Theory

Volumn 48, Issue 9, 2002, Pages 2568-2573

  Barg, Alexander ^a,b,c   Forney Jr , G David ^a,d  

^a IEEE   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Distance distributions; Exponential error bounds; Minimum distance; Random codes; Random linear codes; Typical linear codes; Typical random codes

Indexed keywords

BINARY SYMMETRIC CHANNEL; DISTANCE DISTRIBUTION; EXPONENTIAL ERROR BOUNDS; LINEAR CODE ENSEMBLE; RANDOM CODE ENSEMBLE; TYPICAL LINEAR CODE; TYPICAL RANDOM CODE;

CHANNEL CAPACITY; CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

BINARY CODES;

EID: 0036713329     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.800480     Document Type: Letter

References (9)

1. Simple methods for deriving lower bounds in the theory of codes
2. The method of types
3. Bounds on the average error probability for a code ensemble with fixed composition
4. The random coding bound is tight for the average code
5. Aspects of spin glass theory