Speaking of Infinity

DOI10.1109/TIT.2004.834734zbMath1288.94039OpenAlexW1502929163MaRDI QIDQ3547437

Narayana P. Santhanam, Alon Orlitsky

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2004.834734

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Related Items (2)

A lower-bound for the maximin redundancy in pattern coding ⋮ A lower bound on compression of unknown alphabets

This page was built for publication: Speaking of Infinity