📖
Constructions of Secure Convertible Codes
Manasa Suresh B P, Vinayak Ramkumar, Myna Vajha

Constructions of Secure Convertible Codes

Computer Science & Mathematics Published 2026 Verification Pending

Overview & Synopsis

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 $\ell$ 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.

Advertisement
SPONSOR CONTENT
Indexed from repository: arXiv (arxiv.org)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Constructions of Secure Convertible Codes
Author / Organization Manasa Suresh B P, Vinayak Ramkumar, Myna Vajha
Subject & Discipline cs.IT
Categories Computer Science & Mathematics
Publication Year 2026
License / Rights arXiv Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website arXiv (arxiv.org)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-5956
Original Source Link Visit Source Page on arxiv.org »