3 papers
cs.IT2026
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…
cs.IT2025
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…
cs.IT2025
Enumeration of minimum weight codewords of affine Cartesian codes
Sakshi Dang, Sudhir R. Ghorpade
Affine Cartesian codes were first discussed by Geil and Thomsen in 2013 in a broader framework and were formally introduced by López, RenterÃa-Márquez and Villarreal in 2014. Th…