Constructive spherical codes near the Shannon bound

Details Constructive spherical codes near the Shannon bound Constructive spherical codes near the Shannon bound

2011-01-10

arxiv.org/abs/1101.1895v2

Computer Science

Information Theory

11 pages, 2 figures

Scientific paper

Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance $\rho$. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of $\rho$. The construction is based on the Yaglom map combined with some finite sphere packings obtained from nonconstructive codes for the Euclidean metric. Concatenating geometric codes meeting the TVZ bound with a Lee metric BCH code over $GF(p),$ we obtain spherical codes that are polynomial time constructible. Their parameters outperform those obtained by Lachaud and Stern in 1994. At very high rate they are above 98 per cent of the Shannon bound.

Affiliated with

Also associated with

No associations

Rating

Constructive spherical codes near the Shannon bound 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 Constructive spherical codes near the Shannon bound, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constructive spherical codes near the Shannon bound will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-457022