Random codes: Minimum distances and error exponents

Abstract--Minimum distances, distance distributions, and error exponents on a binary-symmetric channel (BSC) are given for typical codes from Shannon's random code ensemble and for typical codes from a random linear code ensemble. A typical random code of length and rate is shown to have minimum distance (2 ), where ( ) is the Gilbert

• Type: Journal
• Year: 2002
• Where: TIT
• Authors: Alexander Barg, G. David Forney Jr.
• Keywords: Code Ensemble, Random Code, TIT 2002, Typical Codes