PreprintCC BY 4.0arXiv
Constructions of Secure Convertible Codes
Abstract
Secure convertible codes, introduced by Zhang and Rashmi, achieve secrecy capacity under a passive eavesdropper model in which an eavesdropper is allowed to access any ℓ symbols from the initial and final codewords. In this paper, we construct two families of access-optimal secure convertible codes. The first family of codes based on Maximum Rank Distance (MRD) codes is constructed for all parameters in the merge and split regimes and requires a large field size. The second family of codes, constructed using Generalized Reed-Solomon codes, uses smaller fields but is applicable only for certain parameters in the merge and split regimes.
Related
- Optimal Conversion Bandwidth for MDS Convertible Codes in the Split Regime with rF<kF<rI
- Explicit and asymptotically good constructions of Algebraic Geometry codes in the sum-rank metric
- Constructions of LCPs and LCD codes from twisted Reed-Solomon codes
- Error-Correcting Weakly Constrained Codes: Constructions and Achievable Rates
- Double circulant LCD codes over 𝔽2+u𝔽2 and constructions for binary LCD codes
BibTeX
@misc{b2026constructions,
title = {{Constructions of Secure Convertible Codes}},
author = {Manasa Suresh B P and Vinayak Ramkumar and Myna Vajha},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.34863},
eprint = {2610.34863},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.34863},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Constructions of Secure Convertible Codes
AU - Manasa Suresh B P
AU - Vinayak Ramkumar
AU - Myna Vajha
PY - 2026
DA - 2026/10/26
PB - arXiv
DO - 10.48550/arxiv.2610.34863
UR - https://arxiv.org/abs/2610.34863
AB - Secure convertible codes, introduced by Zhang and Rashmi, achieve secrecy capacity under a passive eavesdropper model in which an eavesdropper is allowed to access any ℓ symbols from the initial and final codewords. In this paper, we construct two families of access-optimal secure convertible codes. The first family of codes based on Maximum Rank Distance (MRD) codes is constructed for all parameters in the merge and split regimes and requires a large field size. The second family of codes, constructed using Generalized Reed-Solomon codes, uses smaller fields but is applicable only for certain parameters in the merge and split regimes.
ER -