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

Yin HHF, Ng KH, Shing YT, Lai RWF, Wang X (2021)

Publication Type: Conference contribution

Publication year: 2021

Publisher: IEEE

City/Town: NEW YORK

Conference Proceedings Title: 2021 IEEE INFORMATION THEORY WORKSHOP (ITW)

DOI: 10.1109/ITW48936.2021.9611502

Authors with CRIS profile

Wai Fu Lai Lehrstuhl für Informatik 13 (Angewandte Kryptographie)

Involved external institutions

The Chinese University of Hong Kong (CUHK) CN China (CN) St. Francis Xavier's College / 聖芳濟書院 HK Hong Kong (HK)

How to cite

APA:

Yin, H.H.F., Ng, K.H., Shing, Y.T., Lai, R.W.F., & Wang, X. (2021). Polynomial-Time Construction of Two-Channel Prefix-Free Codes with Given Codeword Lengths. In 2021 IEEE INFORMATION THEORY WORKSHOP (ITW). NEW YORK: IEEE.

MLA:

Yin, Hoover H. F., et al. "Polynomial-Time Construction of Two-Channel Prefix-Free Codes with Given Codeword Lengths." Proceedings of the IEEE Information Theory Workshop (ITW) NEW YORK: IEEE, 2021.

BibTeX: Download