Matrix completion supplies general constructions for both MR-LRCs and MDP convolutional codes that produce sparse generators with many entries drawn from small subfields.
New constructions of MDP convolutional codes with memory 1 for k=2,3
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Design of MDP Convolutional Codes and Maximally Recoverable Codes Through the Lens of Matrix Completion
Matrix completion supplies general constructions for both MR-LRCs and MDP convolutional codes that produce sparse generators with many entries drawn from small subfields.