NobleBlocks

Research indexJournal article

A note on complete code trees

Weng

Proceedings of the IEEE1 Jan 1969

NobleIDark:/48914/w1/20260515/FE078763DOI10.1109/proc.1969.7393

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

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.

Discussion

Topics

More

Suggest a correction or report