On the set of uniquely decodable codes with a given sequence of code word lengths

DOI10.1016/J.DISC.2016.08.013zbMath1371.94616arXiv1608.08381OpenAlexW2511406474MaRDI QIDQ2374158

Adam Woryna

Publication date: 14 December 2016

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

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

zbMATH Keywords

prefix codeSardinas-Patterson algorithmuniquely decodable codecode with finite delayKraft's procedure

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Prefix, length-variable, comma-free codes (94A45)

Related Items (3)

On the proportion of prefix codes in the set of three-element codes ⋮ Two properties of prefix codes and uniquely decodable codes ⋮ On the ratio of prefix codes to all uniquely decodable codes with a given length distribution

Cites Work

• Unnamed Item
• Unnamed Item
• On Uniquely Decipherable Codes with Two Codewords
• Two inequalities implied by unique decipherability

This page was built for publication: On the set of uniquely decodable codes with a given sequence of code word lengths