By Topic

An upper bound on the volume of discrete spheres

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

1 Author(s)
Loeliger, H.-A. ; ISY, Linkoping Univ., Sweden

Finite-length sequences over a finite alphabet with weights are considered. An information-theoretic upper bound on the number of such sequences whose weight does not exceed some given threshold is presented

Published in:

Information Theory, IEEE Transactions on  (Volume:40 ,  Issue: 6 )