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

详细信息    查看全文

• 作者：Adam Woryna ^{adam.woryna@polsl.pl}
• 关键词：Uniquely decodable code ; Prefix code ; Code with finite delay ; Kraft&rsquo ; s procedure ; Sardinas&ndash ; Patterson algorithm
• 刊名：Discrete Mathematics
• 出版年：2017
• 出版时间：6 February 2017
• 年：2017
• 卷：340
• 期：2
• 页码：51-57
• 全文大小：399 K
• 卷排序：340

文摘

For every natural number n≥2n≥2 and every finite sequence LL of natural numbers, we consider the set UDn(L)UDn(L) of all uniquely decodable codes over an nn-letter alphabet with the sequence LL as the sequence of code word lengths, as well as its subsets PRn(L)PRn(L) and FDn(L)FDn(L) consisting of, respectively, the prefix codes and the codes with finite delay. We derive the estimation for the quotient |UDn(L)|∕|PRn(L)||UDn(L)|∕|PRn(L)|, which allows to characterize those sequences LL for which the equality PRn(L)=UDn(L)PRn(L)=UDn(L) holds. We also characterize those sequences LL for which the equality FDn(L)=UDn(L)FDn(L)=UDn(L) holds.