Coding Combinatorial Sources With Costs

DOI10.1109/TIT.2004.826653zbMATH Open1298.94058OpenAlexW2158565344MaRDI QIDQ3547685FDOQ3547685

Authors:

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.826653

Recommendations

• scientific article; zbMATH DE number 3930883
• Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
• Relative uniformity of sources and the comparison of optimal code costs
• Source Coding for Quasiarithmetic Penalties
• Coding theorems on generalized cost measure

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (5)

• Alphabetic coding with exponential costs
• Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
• Title not available (Why is that?)
• Source code with cost as a nonuniform random number generator
• Efficient Coding and Risky Choice

This page was built for publication: Coding Combinatorial Sources With Costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547685)