IMPROVED ASYMPTOTIC PROPERTIES OF ERROR CORRECTING CODES
Abstract
A new upper bound on nonsystematic binary errorcorrecting codes, using a sphere-packing approach and combinatorial an lysis is discussed. A significant refinement is now adde ; tog ther with a detailed study of the asymptotic behavior of the upper bound, this enables one to show that any large code must correct almost all sequences with a larger number of errors than the code was designed for. Thi excess is expressed numerically as a fraction of the esigned error-correcting capability of the code. The fraction is a function of the ratio of the sequence length and the designed error-correcting capability. A possible application might be in the use of a larger code giving almost certain error correction rather than a smaller one wit certain correc ion capability. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1962
- Accession Number
- AD0286756
Entities
People
- Selmer M. Johnson
Organizations
- RAND Corporation