Foto von Hedongliang Liu

M.Sc. Hedongliang Liu

Technische Universität München

Professur für Codierung und Kryptographie (Prof. Wachter-Zeh)

Postadresse

Postal:
Theresienstr. 90
80333 München

Biografie

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 and Cryptography (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 completed the Master's degree with thesis on Decdoing of Interleaved Goppa Codes and Their 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.

Lehre

Abschlussarbeiten

Angebotene Abschlussarbeiten

Dimension of s-Lifted Reed-Solomon Codes

Beschreibung

In the work [1], we developed a method to analyze the dimension of quadratic-curve-lifted Reed-Solomon codes and its asymptotic behavior. The method gives tighter bound on the dimension compared to the estimation given in [2], which defines a more general class of lifted Reed-Solomon codes with regard to curves of higher degree. 

In this work, the student is expected to extended the method in [1] to the general class of codes in [2] to analyse the dimension and its asymptotic behavior.

 

Betreuer:

Laufende Abschlussarbeiten

Secure and Private MR-LRCs based on LRS codes

Beschreibung

Security and privacy analysis on LRS codes or MR-LRCs

Betreuer:

Lower Bound and Constructions of MR-LRCs

Stichworte:
local recovery; code construction; lower bound; distributed storage

Beschreibung

The explosion in the volumes of data being stored online has resulted in distributed storage `s transitioning to erasure coding based schemes. Local Reconstruction Codes (LRCs) have emerged as the codes of choice for these applications. These codes can correct a small number of erasures (which is the typical case) by accessing only a small number of remaining coordinates. A maximally recoverable (MR) LRC offers the best possible blend of such local and global fault tolerance, guaranteeing recovery from all erasure patterns which are information-theoretically correctable given the presence of local recovery groups. MR LRCs have received much attention recently, with many explicit constructions covering different regimes of parameters. 

In this work, the student is expected to understand and be able to explain the derivation of lower bound on the field size and present the constructions  given in [1] of MR-LRCs with a few global parities.

[1]S. Gopi, V. Guruswami and S. Yekhanin, "Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities," in IEEE Transactions on Information Theory, vol. 66, no. 10, pp. 6066-6083, Oct. 2020, doi: 10.1109/TIT.2020.2990981.

Voraussetzungen

Channel Coding

Information Theory

Coding Theory for Storage and Networks (Recommonded)

Betreuer:

Maximally Recoverable LRCs with Skew Polynomials

Stichworte:
distributed storage; local recovery

Beschreibung

Local Reconstruction Codes (LRCs) allow for recovery from a small number of erasures in a local manner based on just a few other codeword symbols. They have emerged as the codes of choice for large scale distributed storage systems due to the very efficient repair of failed storage nodes in the typical scenario of a single or few nodes failing, while also offering fault tolerance against worst-case scenarios with more erasures. A maximally recoverable (MR) LRC offers the best possible blend of such local and global fault tolerance, guaranteeing recovery from all erasure patterns which are information-theoretically correctable given the presence of local recovery groups.

Skew polynomials, as a class of non-commutative polynomials, are gaining research interest for their rich applications in coding and complexity theory.

In this work, the student is expected to understand the theory of skew polynomials and MR-LRCs from [1] and present the construction from [2].

[1] Martínez-Peñas, Umberto, Mohannad Shehadeh, and Frank R. Kschischang. "Codes in the Sum-Rank Metric: Fundamentals and Applications." Foundations and Trends® in Communications and Information Theory 19.5 (2022): 814-1031. (Chapter 2-3)

[2] Gopi, Sivakanth, and Venkatesan Guruswami. "Improved maximally recoverable LRCs using skew polynomials." IEEE Transactions on Information Theory (2022).

Voraussetzungen

Linear Algebra

Channel Coding

Coding Theory for Storage and Networks (recommended)

Betreuer:

Forschung

  • Network Coding
  • Coding Theory and Applications in Storage Systems
  • Code-based Cryptography

Publikationen

2022

  • Bartz, H.; Holzbaur, L.; Liu, H.; Puchinger, S.; Renner, J.; Wachter-Zeh, A.;: Rank-Metric Codes and Their Applications. Foundations and Trends in Communications and Information Theory, 2022 mehr… Volltext ( DOI )
  • Huang C.C.; Liu, H.; Holzbaur, L.; Puchinger, S.; Wachter-Zeh, A.: List Decoding of 2-Interleaved Binary Alternant Codes. 2022 IEEE International Symposium on Information Theory, 2022 mehr…
  • Liu, H.: Linearlized Reed-Solomon Codes and Their Applications. Seminar on Effective Geometry and Algebra, Institute of Mathematical Research, University Rennes 1, 2022 mehr…
  • Liu, H.: Codes for Distributed Storage: Maximally Recoverable Locally Repairable Codes. 2022 Raitenhaslach Doctoral Seminar, 2022 mehr…
  • Liu, H.; Holzbaur, L.; Polianskii, N.; Puchinger, S.; Wachter-Zeh, A.: Quadratic Curve-Lifted Reed-Solomon Codes. 12th International Workshop on Coding and Cryptography (WCC), 2022 mehr…
  • Liu, H.; Holzbaur, L.; Polyanskii, N.; Puchinger, S.; Wachter-Zeh, A.: Quadratic Curve-Lifted Reed-Solomon Codes. 2022 Algebraic Coding Theory Summer School, 2022 mehr…
  • Ott, C.; Liu, H.; Wachter-Zeh, A.: Covering Properties of Sum-Rank Metric Codes. 58th Annual Allerton Conference on Communication, Control, and Computing, 2022 mehr…
  • Porwal, A.; Holzbaur, L.; Liu, H.; Renner, J.; Wachter-Zeh, A.; Weger V.: Interleaved Prange: A New Generic Decoder for Interleaved Codes. The Thirteenth International Conference on Post-Quantum Cryptography (PQCrypto), 2022 mehr…

2021

  • Holzbaur, L.; Liu, H.; Neri, A.; Puchinger, S.; Rosenkilde, J.; Sidorenko, V.; Wachter-Zeh, A.: Decoding of Interleaved Alternant Codes. IEEE Transactions on Information Theory 67 (12), 2021, 8016-8033 mehr… Volltext ( DOI )
  • Liu, H.: Lifted Codes for Local Correction. 2021 Workshop on Coding, Cooperation, and Security in Modern Communication Networks (COCO), 2021 mehr…
  • Liu, H.; Holzbaur, L.; Polyanskii, N.; Puchinger, S.; Wachter-Zeh, A.: Curve-Lifted Reed-Solomon Codes. 2021 Ferienakademie Doctoral Seminar, 2021 mehr…
  • Liu, H.; Polyanskii, N.; Vorobyev, I.; Wachter-Zeh, A.: Almost Affinely Disjoint Subspaces. Finite Fields and Their Applications, 2021 mehr… Volltext ( DOI )
  • Liu, H.; Sabine, P.; Zeh, A.; Wachter-Zeh, A.: Decoding of (Interleaved) Generalized Goppa Codes. IEEE International Symposium on Information Theory (ISIT), 2021 mehr…
  • Liu, H.; Wei, H.; Puchinger, S.; Wachter-Zeh, A.; Schwartz, M.: On the Gap between Scalar ang Vector Solutions of Generalized Combination Networks. IEEE Transactions on Information Theory, 2021 mehr… Volltext ( DOI )
  • Maringer G.; Xhemrishi M.; Puchinger S.; Garb K.; Liu H.; Jerkovits T.; Hiller M.; Wachter-Zeh A.Kürzinger L.;: Analysis of Communication Channels related to Physically Unclonable Functions. arXiv, 2021 mehr…

2020

  • Holzbaur, L.; Liu, H.; Neri, A.; Puchinger, S.; Rosenkilde, J.; Sidorenko, V.; Wachter-Zeh, A.: Success Probability of Decoding Interleaved Alternant Codes. IEEE Information Theory Workshop, 2020 mehr…
  • Liu, H.; Polianski, H.; Vorobyev, I.; Wachter-Zeh, A.: Almost Affinely Disjointly Subspaces. WS20/21 Doctoral Seminar, 2020 mehr…
  • Liu, H.; Wei, H.; Puchinger, S.; Wachter-Zeh, A.; Schwartz, M.: On the Gap between Scalar ang Vector Solutions of Generalized Combination Networks. 2020 Workshop on Coding, Cooperation, and Security in Modern Communication Networks (COCO), 2020 mehr…
  • Liu, H.; Wei, H.; Puchinger, S.; Wachter-Zeh, A.; Schwartz, M.: On the Gap between Scalar and Vector Solutions of Generalized Combination Networks. 2020 IEEE International Symposium in Information Theory, 2020 mehr…

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 mehr…
  • 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 mehr…
  • 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 mehr…
  • Liu, H.: Bounds on Vector Solutions of Generalized Combination Networks. 019 Workshop on Coding, Cooperation, and Security in Modern Communication Networks (COCO 2019), 2019 mehr…
  • 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 mehr…
  • 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 mehr…

2018

  • Liu, H.; Holzbaur, L.; Wachter-Zeh, A.: Locality in Crisscross Error Correction. Munich Doctoral Seminar on Communications 2018, 2018 mehr…
  • Liu, H.; Holzbaur, L.; Wachter-Zeh, A.: Locality in Crisscross Error Correction. Sixteenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT), 2018 mehr…
  • Liu., H.: Locally Decoding of Crisscross Errors. Number Theory and Coding Theory: Contemporary Applications in Security, 2018 mehr…