Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

TIT
2002

favoriteEmaildiscussreport

62views more TIT 2002»

Random codes: Minimum distances and error exponents

13 years 4 months ago

Random codes: Minimum distances and error exponents

Download www.ece.umd.edu

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

Alexander Barg, G. David Forney Jr.

Real-time Traffic

Code Ensemble | Random Code | TIT 2002 | Typical Codes |

claim paper

Related Content

» Distance distribution of binary codes and the error probability of decoding

» Relations between random coding exponents and the statistical physics of random codes

» Error Exponents of ErasureList Decoding Revisited via Moments of Distance Enumerators

» Approaching BlokhZyablov Error Exponent with LinearTime EncodableDecodable Codes

» Coding over an Erasure Channel with a Large Alphabet Size

» Group codes outperform binarycoset codes on nonbinary symmetric memoryless channels

» Error Exponent for MultipleAccess ChannelsLower Bounds

» TimeSharing Vs SourceSplitting in the SlepianWolf Problem Error Exponents Analysis

» Hardness of Approximating the Minimum Distance of a Linear Code

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TIT
Authors	Alexander Barg, G. David Forney Jr.

Comments (0)