7 papers
Design of MDP Convolutional Codes and Maximally Recoverable Codes Through the Lens of Matrix Completion
Sakshi Dang, Julia Lieb, Pedro Soto +1
The matrix completion problem provides a unifying lens through which many fundamental problems in coding theory can be viewed. In this paper, we investigate Locally Recoverable Cod…
Optimal Multidimensional Convolutional Codes
Z. Abreu, J. Lieb, R. Pinto +1
In this paper, we analyze -dimensional (D) convolutional codes with finite support, viewed as a natural generalization of one-dimensional (1D) convolutional codes to higher d…
Pseudo-MDP Convolutional Codes for Burst Erasure Correction
Zita Abreu, Julia Lieb, Raquel Pinto
Convolutional codes are a class of error-correcting codes that performs very well over erasure channels with low delay requirements. In particular, Maximum Distance Profile (MDP) c…
Construction and Decoding of Convolutional Codes with optimal Column Distances
Julia Lieb, Michael Schaller
The construction of Maximum Distance Profile (MDP) convolutional codes in general requires the use of very large finite fields. In contrast convolutional codes with optimal column…
A Matrix Completion Approach for the Construction of MDP Convolutional Codes
Sakshi Dang, Julia Lieb, Okko Makkonen +2
Maximum Distance Profile (MDP) convolutional codes are an important class of channel codes due to their maximal delay-constrained error correction capabilities. The design of MDP c…
Construction of LDPC convolutional codes with large girth from Latin squares
Elisa Junghans, Julia Lieb
Due to their capacity approaching performance low-density parity-check (LDPC) codes gained a lot of attention in the last years. The parity-check matrix of the codes can be associa…