Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Refinement of the sphere packing bound for symmetric channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Altug, Y. ; Sch. of Electr. & Comput. Eng., Cornell Univ., Ithaca, NY, USA ; Wagner, A.B.

We provide an improved sphere packing bound for positive and symmetric discrete memoryless channels that significantly improves the pre-factor in front of the exponent. Specifically, the presented bound decays only polynomially in N. Further, for the binary symmetric channel, the order of our pre-factor is tight.

Published in:

Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on

Date of Conference:

28-30 Sept. 2011