On the ratio of prefix codes to all uniquely decodable codes with a given length distribution

DOI10.1016/j.dam.2018.02.026zbMath1439.94016arXiv1804.02531OpenAlexW2796080007MaRDI QIDQ1752605

Adam Woryna

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.02531

zbMATH Keywords

length distributionprefix codeKraft's inequalitySardinas-Patterson algorithmuniquely decodable code

Mathematics Subject Classification ID

Decoding (94B35) Prefix, length-variable, comma-free codes (94A45)

Related Items (2)

On the proportion of prefix codes in the set of three-element codes ⋮ Two properties of prefix codes and uniquely decodable codes

Cites Work

• Unnamed Item
• Unnamed Item
• Three-element codes with one \(d\)-primitive word
• \(d\)-words and \(d\)-languages
• On the set of uniquely decodable codes with a given sequence of code word lengths
• A note on free subsemigroups with two generators
• Two inequalities implied by unique decipherability

This page was built for publication: On the ratio of prefix codes to all uniquely decodable codes with a given length distribution