Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4646555 | Discrete Mathematics | 2017 | 7 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Adam Woryna,