On the cost of worst case coding length constraints

DOI10.1109/18.959291MaRDI QIDQ4544758zbMATH OpenOpenAlexFDO

Authors Dror Baron, Andrew C. Singer

Publication date 4 August 2002

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

Full work available at URL https://semanticscholar.org/paper/566cb24073f3317394a26a0c6c18a527d5599905

zbMATH Keywords

data compressionredundancyFibonacci numbersHuffman codingsource codinguniquely decodable codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Source coding (94A29) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Recommendations

• Bounding the inefficiency of length-restricted prefix codes
• Coding for channels with cost constraints
• scientific article; zbMATH DE number 7250164
• On the redundancy of optimal codes with limited word length
• scientific article; zbMATH DE number 4156353
• Coding theorems on generalized cost measure
• scientific article; zbMATH DE number 2036351
• scientific article; zbMATH DE number 3880583
• Constraints on weights in binary codes
• On maximum length convolutional codes under a trellis complexity constraint

This page was built for publication: On the cost of worst case coding length constraints

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