:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Ramkumar, Vinayak, Kong, Xiangliang, Sai, G. Yeswanth, Vajha, Myna, Krishnan, M. Nikhil
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	https://arxiv.org/abs/2508.06219
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Lower Bounds on Conversion Bandwidth for MDS Convertible Codes in Split Regime
by: Wang, Lewen, et al.
Published: (2025)

Tight Lower Bounds on the Bandwidth Cost of MDS Convertible Codes in the Split Regime
by: Singhvi, Shubhransh, et al.
Published: (2025)

MDS Generalized Convertible Code
by: Ge, Songping, et al.
Published: (2024)

Bandwidth Cost of Locally Repairable Convertible Codes in the Global Merge Regime
by: Chopra, Saransh, et al.
Published: (2026)

$\varepsilon$-MSR Codes for Any Set of Helper Nodes
by: Ramkumar, Vinayak, et al.
Published: (2024)

Non-Binary Covering Codes for Low-Access Computations
by: Ramkumar, Vinayak, et al.
Published: (2024)

Quantum Locally Recoverable Codes via Good Polynomials
by: Sharma, Sandeep, et al.
Published: (2024)

Coding Schemes for Document Exchange under Multiple Substring Edits
by: Narayanan, Hrishi, et al.
Published: (2026)

Perfect Subset Privacy in Polynomial Computation via Reed-Muller Information Super-sets
by: Deng, Zirui, et al.
Published: (2024)

Bounds and Optimal Constructions of Generalized Merge-Convertible Codes for Code Conversion into LRCs
by: Shi, Haoming, et al.
Published: (2025)

Upper Bounds on Multiple $b$-Burst Deletion-Correcting Codes
by: Wang, Chen, et al.
Published: (2026)

MDS, Hermitian Almost MDS, and Gilbert-Varshamov Quantum Codes from Generalized Monomial-Cartesian Codes
by: Barbero-Lucas, Beatriz, et al.
Published: (2023)

On the Maximal Length of MDS Elliptic Codes
by: Chen, Haojie, et al.
Published: (2026)

Individual Confidential Computing of Polynomials over Non-Uniform Information
by: Tarnopolsky, Saar, et al.
Published: (2025)

Column Twisted Reed-Solomon Codes as MDS Codes
by: Liu, Wei, et al.
Published: (2025)

Generalized GM-MDS: Polynomial Codes are Higher Order MDS
by: Brakensiek, Joshua, et al.
Published: (2023)

Batch Array Codes
by: Kong, Xiangliang, et al.
Published: (2024)

MDS Stabilizer Poset Codes
by: Can, Mahir Bilen
Published: (2024)

The Entropy Characterization of Quantum MDS Codes
by: Sun, Hua
Published: (2025)

On Iso-Dual MDS Codes From Elliptic Curves
by: Zhu, Yunlong, et al.
Published: (2025)

MDS and NMDS Codes from the Extended Twisted Generalized Reed-Solomon Codes
by: Wang, Yanli, et al.
Published: (2026)

A Partial-Exclusion Repair Scheme for MDS Codes
by: Zhao, Wei, et al.
Published: (2026)

Improved Field Size Bounds for Higher Order MDS Codes
by: Brakensiek, Joshua, et al.
Published: (2022)

New Bounds and Constructions for Variable Packet-Error Coding
by: Kong, Xiangliang, et al.
Published: (2025)

Construction of MDS Euclidean Self-Dual Codes via Multiple Subsets
by: Meng, Weirong, et al.
Published: (2025)

Optimal Repair of $(k+2, k, 2)$ MDS Array Codes
by: Zhang, Zihao, et al.
Published: (2025)

The Incidence-Multiplicity Bound for Linear Exact Repair in MDS Array Codes
by: Wu, Huawei
Published: (2026)

Block-MDS QC-LDPC Codes for Information Reconciliation in Key Distribution
by: Tauz, Lev, et al.
Published: (2024)

Improved Decoding Algorithms for MDS and Almost-MDS Codesfrom Twisted GRS Codes
by: Wang, Guodong, et al.
Published: (2025)

Twisted and Twisted Linearized Reed--Solomon Codes, LCD and ACD MDS constructions
by: Bhowmick, Sanjit, et al.
Published: (2026)

Convertible Codes for Data and Device Heterogeneity
by: Gruica, Anina, et al.
Published: (2026)

Generic Construction of Optimal-Access Binary MDS Array Codes with Smaller Sub-packetization
by: Ma, Lan, et al.
Published: (2025)

Accelerating Data Access for Single Node in Distributed Storage Systems via MDS Codes
by: Shi, Hao, et al.
Published: (2025)

Two Classes of Quantum MDS Codes with Large Minimal Distance
by: Wang, Puyin, et al.
Published: (2024)

Service Rate Regions of MDS Codes & Fractional Matchings in Quasi-uniform Hypergraphs
by: Ly, Hoang, et al.
Published: (2025)

On the Reliability of Information Retrieval From MDS Coded Data in DNA Storage
by: Hanna, Serge Kas
Published: (2025)

Weakly-Private Information Retrieval From MDS-Coded Distributed Storage
by: Orvedal, Asbjørn O., et al.
Published: (2024)

Achieving Capacity of PIR with Private Side Information with Low Sub-packetization and without MDS Codes
by: Erhili, Leila, et al.
Published: (2024)

Near MDS and near quantum MDS codes via orthogonal arrays
by: Pang, Shanqi, et al.
Published: (2023)

Non-Reed-Solomon Type MDS Codes from Elliptic Curves
by: Wang, Puyin, et al.
Published: (2025)