An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To be presented in the 44th Allerton conference, 27-29 September 2006. The full paper version was submitted to the IEEE Trans.

Scientific paper

This paper derives an improved sphere-packing (ISP) bound targeting codes of short to moderate block lengths. We first review the 1967 sphere-packing (SP67) bound for discrete memoryless channels, and a recent improvement by Valembois and Fossorier. These concepts are used for the derivation of a new lower bound on the decoding error probability (referred to as the ISP bound) which is uniformly tighter than the SP67 bound and its recent improved version. Under a mild condition, the ISP bound is applicable to general memoryless channels, and some of its applications are exemplified. Its tightness is studied by comparing it with bounds on the ML decoding error probability. It is exemplified that the ISP bound suggests an interesting alternative to the 1959 sphere-packing (SP59) bound of Shannon for the Gaussian channel, especially for digital modulations of high spectral efficiency.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-647195

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.