On Higher-Order Minimal Linear Codes
IEEE Transactions on Information Theory · 2026-06 · 72 (6) · 3799-3808
DOI: 10.1109/tit.2026.3681362 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-06. Verfasst von Changsu Wang und 1 weiteren Autor:innen. Die Arbeit nennt 23 Literaturangaben.
Abstract (Originalsprache)
Secret sharing was introduced by Shamir to distribute a secret among a group of participants. Later, Massey generalized this approach using minimal linear codes. Recent research has extensively explored the basic properties, code parameters, and constructions of minimal linear codes from algebraic, combinatorial, and geometric perspectives. In this paper, we further generalize Massey’s scheme to multi-secret sharing by introducing higher-order minimal linear codes . We present some fundamental properties of these codes, including two necessary and sufficient conditions for $r$ th-order minimality. These conditions generalize the Heng–Ding–Zhou and the Lu–Wu–Cao conditions for ordinary minimal linear codes, respectively. We also derive bounds on the parameters of higher-order minimal linear codes. Importantly, we prove that these codes are asymptotically good, exhibiting both non-vanishing rate and relative distance as the code length tends to infinity. A geometric characterization establishes an equivalence between $r$ th-order minimal linear codes and cutting $r$ -blocking sets in projective geometry. Finally, we provide higher-order minimal linear codes using punctured simplex codes, Kronecker products and subfield subcodes, respectively.
Zitieren
APA
Wang, C., & Peng, J. (2026). On Higher-Order Minimal Linear Codes. IEEE Transactions on Information Theory, 72(6), 3799-3808. https://doi.org/10.1109/tit.2026.3681362
Vancouver
Wang C, Peng J. On Higher-Order Minimal Linear Codes. IEEE Transactions on Information Theory. 2026;72(6):3799-3808. doi:10.1109/tit.2026.3681362
BibTeX
@article{Wang2026,
author = {Wang, Changsu and Peng, Jie},
title = {On Higher-Order Minimal Linear Codes},
journal = {IEEE Transactions on Information Theory},
year = {2026},
volume = {72},
number = {6},
pages = {3799--3808},
doi = {10.1109/tit.2026.3681362}
}
EUVIMED