A short note on the redundancy of degree \(\alpha\)
It is known that there always exists an instantaneous, uniquely decodable code such that the redundancy of the discrete source is bounded between 0 and 1. \textit{O. Johnsen} [IEEE Trans. Inf. Theory IT-26, 220-222 (1980; Zbl 0431.94025)] provided sharper bounds on the redundancy by making assumptions on the most likely source letter. In this paper we have obtained bounds on the redundancy of degree \(\alpha\) by applying Johnsen's approach.
scientific article; zbMATH DE number 3976929
scientific article