Polynomial-Time Construction of Two-Channel Prefix-Free Codes with Given Codeword Lengths

Hoover H.F. Yin, Ka Hei Ng, Yu Ting Shing, Russell W.F. Lai, Xishi Wang

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

2 Citations (Scopus)

Abstract


Original languageEnglish
Title of host publication2021 IEEE Information Theory Workshop, ITW 2021 - Proceedings
PublisherIEEE
ISBN (Electronic)978-1-6654-0312-2
DOIs
Publication statusPublished - 2021
MoE publication typeA4 Conference publication
EventIEEE Information Theory Workshop - Virtual, Online, Japan
Duration: 17 Oct 202121 Oct 2021

Workshop

WorkshopIEEE Information Theory Workshop
Abbreviated titleITW
Country/TerritoryJapan
CityVirtual, Online
Period17/10/202121/10/2021

Funding

H. Yin is with the Institute of Network Coding, The Chinese University of Hong Kong. K. Ng is with the Department of Physics, The Chinese University of Hong Kong. Y. Shing is with the Mathematics Panel, St. Francis Xavier’s College, Hong Kong. R. Lai is with the Chair of Applied Cryptography, Friedrich-Alexander-Universität Erlangen-Nürnberg, and is supported by the State of Bavaria at the Nuremberg Campus of Technology (NCT). X. Wang is with the Department of Information Engineering, The Chinese University of Hong Kong.

Cite this