DocumentCode
907988
Title
A note on complete code trees
Author
Lih-Jyh Weng
Volume
57
Issue
10
fYear
1969
Firstpage
1765
Lastpage
1765
Abstract
The possible values of the number of messages generated by an information source which can be encoded into complete tree codes for successive coding alphabet sizes 2, 3, 4,..., D are derived. Properties and relations for the smallest such values are given.
Keywords
Antenna arrays; Antenna theory; Antennas and propagation; Apertures; Density functional theory; Interpolation; Laboratories; Probability density function;
fLanguage
English
Journal_Title
Proceedings of the IEEE
Publisher
ieee
ISSN
0018-9219
Type
jour
DOI
10.1109/PROC.1969.7393
Filename
1449323
Link To Document