Hedongliang Liu (a.k.a. Lia) starts her doctorate study under the supervision of Prof. Antonia Wachter-Zeh since March 2019 and works as a research assistant in Coding for Communications and Storage (COD) group.
She received her M. Sc. degree in Communication Engineering at TUM in 2019 under the MSCE program. The interests of her Master study are coding theory and applications.
She received her Bachelor's degree in Information Engineering at Southeast University, China in 2016. Through TUMexchange program she spent one semester at Munich, studying at TUM.
Coded caching problem has two phases, placement phase and delivery phase.
For a fixed placement scheme, designing the delivery protocol is equivalent to the index coding problem.
Transforming a coded caching problem with coded placement to the corresponding index coding problem is a hignly-interested topic and what is the optimal delivery scheme for a coded caching problem with coded placement is still an open problem.
References:
[1] N. S. Karat, S. Samuel, and B. S. Rajan. Optimal error correcting index codes for some generalized index coding problems. IEEE Transactions on Communications, 67(2):929–942, 2019.
[2] Z. Chen, P. Fan, and K. B. Letaief. Fundamental limits of caching: improved bounds for users with small buffers. IET Communications, 10(17):2315–2318, 2016.
The goal is to implement the list decoding algorithm in [1].
Fundalmentals on Goppa codes can be found in [2, Chap 12.3], [3, Chap 2].
Fundalmentals on list decoding can be found in [4, Chap 12], [5, Chap 9].
References:
[1] D. Augot, M. Barbier, and A. Couvreur, “List-decoding of binary goppa codes up to the binary johnson bound,” in 2011 IEEE Information Theory Workshop, pp. 229–233, Oct 2011.
[2] F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes. 1978.
[3] H. Liu, “Decoding of interleaved goppa codes and their applications in code-based cryptosystem,” Master’s thesis, Technical University of Munich, Dec. 2018.
[4] J. Justesen and T. Høholdt, A course in error-correcting codes. Z¨urich: European Mathematical Society (EMS), 2004.
[5] R. M. Roth, Introduction to Coding Theory. Cambridge University Press, 2006.
In some communication systems end users are equiped with storages, the communication load during the peak hours can be reduced by having users pre-fetch part of the content during the scilent hours. Coded caching is a study to design the pre-fetching without the knowledge of users demands and the delivery scheme based on the users caches. However, many current schemes are facing the subpacketization problem in order to achieve the optimal load.
Coded caching is a study to reduce the transmission delay in broad-/multi-cast by designing the cached data and the transmitting data with coding strategies. There are two phases in coded cahing schemes, placement phase and delivery phase. Coding scheme can be applied in both phase in order to gain in reducing the transmission delay.
Prerequisites
Linear Algebra
Basic Programming
Channel Coding (Recommended)
Contact
Hedongliang Liu Doctoral Researcher Technical University of Munich Department of Electrical and Computer Engineering Coding for Communications and Data Storage (COD) Group Theresienstrasse 90 Building N4, Room 3415A D-80333 Munich Phone: +49 89 289 29062 lia.liu@tum.dehttp://www.lnt.ei.tum.de/en/people/doctoral-researchers/liu/
Supervisor:
Hedongliang Liu
----✔
Coded v.s. Uncoded Placement Schemes in Coded Caching
Coded v.s. Uncoded Placement Schemes in Coded Caching
Description
Topic for "Hauptseminar Digitale Kommunikationssysteme" (MSEI) (https://www.ei.tum.de/index.php?id=5492) NOT for "Seminar on Topics in Communications Engineering" (MSCE).
The goal of coded caching is to minimize the transmission throughput during the peak hours while allowing users to pre-fetch some data during the idle hours. Using certain algebraic coding scheme in the placement phase of coded caching problems has been shown beneficial in terms of transmission throughput [3].
The task of this topic is to understand the coded placement schemes in [1] and [2] and give a description of the two schemes.
[3] Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr. The exact rate-memory tradeoff for caching with uncoded prefetching.IEEE Trans-actions on Information Theory, 64(2):1281–1296, Feb 2018. (https://ieeexplore-ieee-org.eaccess.ub.tum.de/document/8226776)
H. Liu, H. Wei, S. Puchinger, A. Wachter-Zeh, M. Schwartz: On the Gap between Scalar and Vector Solutions of Generalized Combination Networks. 2020 IEEE International Symposium in Information Theory, 2020 more…
2019
Holzbaur, L.; Liu, H.; Puchinger, S.; Wachter-Zeh, A.: On Decoding and Applications of Interleaved Goppa Codes. 2019 IEEE International Symposium on Information Theory (ISIT), 2019 more…
Holzbaur, L.; Liu, H.; Puchinger, S.; Wachter-Zeh, A.: On Decoding and Crypto-Application of Interleaved Goppa Codes. 2019 Munich Workshop on Coding and Cryptography (MWCC), 2019 more…
Holzbaur, L.; Liu, H.; Puchinger, S.; Wachter-Zeh, A.: On Decoding and Crypto-Application of Interleaved Goppa Codes. Munich Doctoral Seminar on Communications (MSC) 2019, 2019 more…
Liu, H.: Bounds on Vector Solutions of Generalized Combination Networks. 019 Workshop on Coding, Cooperation, and Security in Modern Communication Networks (COCO 2019), 2019 more…
Liu, H.; Holzbaur, L.; Puchinger, S.; Wachter-Zeh, A.: Decoding of Interleaved Goppa Codes and Key-Size Reduction for McEliece Cryptosystem. Joint Workshop on Communications and Coding (JWCC), 2019 more…
Liu, H.; Holzbaur, L.; Puchinger, S.; Wachter-Zeh, A.: Decoding of Interleaved Goppa Codes and Their Applications in Code-based Cryptosystem. 33. Sitzung der ITG-Fachgruppe "Angewandte Informationstheorie", 2019 more…
2018
Hedongliang Liu: Locally Decoding of Crisscross Errors. Number Theory and Coding Theory: Contemporary Applications in Security, 2018 more…
Hedongliang Liu, Lukas Holzbaur, Antonia Wachter-Zeh: Locality in Crisscross Error Correction. Munich Doctoral Seminar on Communications 2018, 2018 more…
Liu, H.; Holzbaur, L.; Wachter-Zeh, A.: Locality in Crisscross Error Correction. Sixteenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT), 2018 more…
