A Matrix Completion Approach for the Construction of MDP Convolutional Codes
Fuente:
arXiv
Saved in:
| Main Authors: | Dang, Sakshi, Lieb, Julia, Makkonen, Okko, Soto, Pedro, Sprintson, Alex |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Design of MDP Convolutional Codes and Maximally Recoverable Codes Through the Lens of Matrix Completion
by: Dang, Sakshi, et al.
Published: (2026)
by: Dang, Sakshi, et al.
Published: (2026)
Flexible Field Sizes in Secure Distributed Matrix Multiplication via Efficient Interference Cancellation
by: Makkonen, Okko
Published: (2024)
by: Makkonen, Okko
Published: (2024)
Pseudo-MDP Convolutional Codes for Burst Erasure Correction
by: Abreu, Zita, et al.
Published: (2026)
by: Abreu, Zita, et al.
Published: (2026)
Analog Secure Distributed Matrix Multiplication
by: Makkonen, Okko, et al.
Published: (2025)
by: Makkonen, Okko, et al.
Published: (2025)
General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers
by: Makkonen, Okko, et al.
Published: (2022)
by: Makkonen, Okko, et al.
Published: (2022)
Secret Sharing for Secure and Private Information Retrieval: A Construction Using Algebraic Geometry Codes
by: Makkonen, Okko, et al.
Published: (2024)
by: Makkonen, Okko, et al.
Published: (2024)
Construction and Decoding of Convolutional Codes with optimal Column Distances
by: Lieb, Julia, et al.
Published: (2026)
by: Lieb, Julia, et al.
Published: (2026)
Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval
by: Makkonen, Okko, et al.
Published: (2024)
by: Makkonen, Okko, et al.
Published: (2024)
An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes
by: Abreu, Zita, et al.
Published: (2024)
by: Abreu, Zita, et al.
Published: (2024)
A Linear Programming Approach to Private Information Retrieval
by: Heidarzadeh, Anoosheh, et al.
Published: (2025)
by: Heidarzadeh, Anoosheh, et al.
Published: (2025)
Approximate Gradient Coding for Privacy-Flexible Federated Learning with Non-IID Data
by: Makkonen, Okko, et al.
Published: (2024)
by: Makkonen, Okko, et al.
Published: (2024)
A New Approach to Harnessing Side Information in Multi-Server Private Information Retrieval
by: Wang, Ningze, et al.
Published: (2024)
by: Wang, Ningze, et al.
Published: (2024)
Optimal Multidimensional Convolutional Codes
by: Abreu, Z., et al.
Published: (2026)
by: Abreu, Z., et al.
Published: (2026)
Construction of LDPC convolutional codes with large girth from Latin squares
by: Junghans, Elisa, et al.
Published: (2025)
by: Junghans, Elisa, et al.
Published: (2025)
Optimizing Leaky Private Information Retrieval Codes to Achieve ${O}(\log K)$ Leakage Ratio Exponent
by: Zhao, Wenyuan, et al.
Published: (2025)
by: Zhao, Wenyuan, et al.
Published: (2025)
A Low-Complexity Scheme for Multi-Message Private Information Retrieval
by: Wang, Ningze, et al.
Published: (2025)
by: Wang, Ningze, et al.
Published: (2025)
On Subset Retrieval and Group Testing Problems with Differential Privacy Constraints
by: Gonen, Mira, et al.
Published: (2025)
by: Gonen, Mira, et al.
Published: (2025)
Secure Distributed Matrix Multiplication with Precomputation
by: Cartor, Ryann, et al.
Published: (2024)
by: Cartor, Ryann, et al.
Published: (2024)
Information-Set Decoding for Convolutional Codes
by: Gassner, Niklas, et al.
Published: (2024)
by: Gassner, Niklas, et al.
Published: (2024)
A new method for erasure decoding of convolutional codes
by: Lieb, Julia, et al.
Published: (2025)
by: Lieb, Julia, et al.
Published: (2025)
Easy repair via codes with simplex locality
by: Kuijper, Margreta, et al.
Published: (2025)
by: Kuijper, Margreta, et al.
Published: (2025)
Distributed Matrix-Vector Multiplication: A Convolutional Coding Approach
by: Das, Anindya Bijoy, et al.
Published: (2019)
by: Das, Anindya Bijoy, et al.
Published: (2019)
Construction of Complete Complementary Codes over Small Alphabet
by: Sarkar, Palash, et al.
Published: (2021)
by: Sarkar, Palash, et al.
Published: (2021)
Construction of observable and MDP convolutional codes with good decodable properties for erasure channels by I/S/O representations
by: DeCastro-García, Noemí, et al.
Published: (2024)
by: DeCastro-García, Noemí, et al.
Published: (2024)
Random Staircase Generator Matrix Codes: Performance Analysis and Construction
by: Wang, Qianfan, et al.
Published: (2024)
by: Wang, Qianfan, et al.
Published: (2024)
Detecting Convolutional Codes: A Markovian Approach with LRT and DNN
by: Pandey, Harshvardhan, et al.
Published: (2025)
by: Pandey, Harshvardhan, et al.
Published: (2025)
Constructing Quantum Convolutional Codes via Difference Triangle Sets
by: Nourozi, Vahid, et al.
Published: (2026)
by: Nourozi, Vahid, et al.
Published: (2026)
New Construction of Locally q-ary Sequential Recoverable Codes: Parity-check Matrix Approach
by: Baghban, Akram, et al.
Published: (2025)
by: Baghban, Akram, et al.
Published: (2025)
Subspace-Informed Matrix Completion
by: Ardakani, Hamideh. Sadat Fazael, et al.
Published: (2024)
by: Ardakani, Hamideh. Sadat Fazael, et al.
Published: (2024)
Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication
by: Gómez-Vilardebó, Jesús, et al.
Published: (2024)
by: Gómez-Vilardebó, Jesús, et al.
Published: (2024)
Group Complete-$\{s\}$ Pliable Index Coding
by: Eghbal, Sina, et al.
Published: (2024)
by: Eghbal, Sina, et al.
Published: (2024)
Constructive Approaches to Perception-Aware Lossy Source Coding: Information-Theoretic Guidelines
by: Hussein, Ali, et al.
Published: (2026)
by: Hussein, Ali, et al.
Published: (2026)
Optimal Linear MAP Decoding of Convolutional Codes
by: Li, Yonghui, et al.
Published: (2025)
by: Li, Yonghui, et al.
Published: (2025)
Algorithms for Computing the Free Distance of Convolutional Codes
by: Abreu, Zita, et al.
Published: (2024)
by: Abreu, Zita, et al.
Published: (2024)
Sequential Decoding of Convolutional Codes for Synchronization Errors
by: Banerjee, Anisha, et al.
Published: (2022)
by: Banerjee, Anisha, et al.
Published: (2022)
Near-Optimal Weighted Matrix Completion
by: López, Oscar
Published: (2022)
by: López, Oscar
Published: (2022)
Robust Matrix Completion with Deterministic Sampling via Convex Optimization
by: Wang, Yinjian
Published: (2024)
by: Wang, Yinjian
Published: (2024)
Systematic Bernoulli Generator Matrix Codes
by: Wang, Yixin, et al.
Published: (2025)
by: Wang, Yixin, et al.
Published: (2025)
Structured Codes for Distributed Matrix Multiplication
by: Malak, Derya
Published: (2024)
by: Malak, Derya
Published: (2024)
New Quantum Codes from Evaluation and Matrix-Product Codes
by: Galindo, Carlos, et al.
Published: (2014)
by: Galindo, Carlos, et al.
Published: (2014)
Similar Items
-
Design of MDP Convolutional Codes and Maximally Recoverable Codes Through the Lens of Matrix Completion
by: Dang, Sakshi, et al.
Published: (2026) -
Flexible Field Sizes in Secure Distributed Matrix Multiplication via Efficient Interference Cancellation
by: Makkonen, Okko
Published: (2024) -
Pseudo-MDP Convolutional Codes for Burst Erasure Correction
by: Abreu, Zita, et al.
Published: (2026) -
Analog Secure Distributed Matrix Multiplication
by: Makkonen, Okko, et al.
Published: (2025) -
General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers
by: Makkonen, Okko, et al.
Published: (2022)