A lower bound on the expected length of one-to-one codes
From MaRDI portal
Publication:4324151
DOI10.1109/18.333891zbMath0811.94019WikidataQ114830306 ScholiaQ114830306MaRDI QIDQ4324151
Publication date: 1 March 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d7a6259e14a214bca5261d094fd2e1fd5211bc15
94A29: Source coding
Related Items
Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources, Assembling approximately optimal binary search trees efficiently using arithmetics, New lower bounds on the cost of binary search trees