Distance Spectrum Based Upper Error Bound for Lattices

Details Distance Spectrum Based Upper Error Bound for Lattices Distance Spectrum Based Upper Error Bound for Lattices

2012-01-29

arxiv.org/abs/1201.6022v3

Computer Science

Information Theory

A subset of this work was submitted to the IEEE International Symposium on Information Theory (ISIT) 2012

Scientific paper

An upper bound on the error probability of specific lattices, based on their distance spectrum is constructed. The derivation is accomplished using a simple alternative to the Minkowski-Hlawka mean-value theorem of the geometry of numbers. In many ways the new bound greatly resembles the Shulman-Feder bound for linear codes. Based on the new bound, an error exponent is derived for specific lattice sequences (of increasing dimension) over the AWGN channel. Measuring the sequence's gap to capacity, using the new exponent is demonstrated.

Affiliated with

Also associated with

No associations

Rating

Distance Spectrum Based Upper Error Bound for Lattices 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 Distance Spectrum Based Upper Error Bound for Lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance Spectrum Based Upper Error Bound for Lattices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-379120