Decision Procedure for the Existence of Two-Channel Prefix-Free Codes
Refereed conference paper presented and published in conference proceedings


Times Cited
Web of Science0WOS source URL (as at 26/10/2020) Click here for the latest count
Scopus (as at 26/10/2020)
Altmetrics Information
.

Other information
AbstractThe Kraft inequality gives a necessary and sufficient condition for the existence of a single channel prefix-free code. However, the multichannel Kraft inequality does not imply the existence of a multichannel prefix-free code in general. It is natural to ask whatever there exists an efficient decision procedure for the existence of multichannel prefix-free codes. In this paper, we tackle the two-channel case of the above problem by relating it to a constrained rectangle packing problem. Although a general rectangle packing problem is NP-complete, the extra imposed constraints allow us to propose an algorithm which can solve the problem efficiently.
All Author(s) ListHoover H. F. Yin, Ka Hei Ng, Yu Ting Shing, Russell W. F. Lai, Xishi Wang
Name of Conference2019 IEEE International Symposium on Information Theory (ISIT)
Start Date of Conference07/07/2019
End Date of Conference12/07/2019
Place of ConferenceParis
Country/Region of ConferenceFrance
Proceedings Title2019 IEEE International Symposium on Information Theory (ISIT)
Title of Publication2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
Year2019
PublisherIEEE
Pages1522 - 1526
ISBN978-1-5386-9291-2
LanguagesEnglish-United Kingdom
Web of Science Subject CategoriesComputer Science, Information Systems;Computer Science, Theory & Methods;Computer Science

Last updated on 2020-27-10 at 00:08