DocumentCode
1215260
Title
An upper bound on the volume of discrete spheres
Author
Loeliger, Hans-Andrea
Author_Institution
ISY, Linkoping Univ., Sweden
Volume
40
Issue
6
fYear
1994
fDate
11/1/1994 12:00:00 AM
Firstpage
2071
Lastpage
2073
Abstract
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
Keywords
information theory; sequences; discrete spheres; finite alphabet; finite length sequences; information theory; threshold; upper bound; volume; weights; Algebra; Computer science; Constellation diagram; Encyclopedias; Entropy; Error correction codes; Galois fields; Pervasive computing; Reed-Solomon codes; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.340483
Filename
340483
Link To Document