By Topic

The upper error bound of a new near-optimal code

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
$33 $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

1 Author(s)

A code is implicitly constructed' from a lattice and its Dirichlet regions and, for Gaussian noise, the worst error probability of any code point is upperbounded in closed form by a chi-square distribution. The bound shows that fairly efficient codes can be obtained, particularly, at high signal-to-noise ratio (SNR) the bound approaches asymptotically the error bound of an optimal code. The derivation is by a promising new method in which the Minkowski-H!awka theorem of the geometry of numbers is used in place of the we!l-known random coding arguments.

Published in:

IEEE Transactions on Information Theory  (Volume:21 ,  Issue: 4 )