activity
20082026
most citedStrongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes

295 citations · 306 across the 8 of their papers we have counts for

collaborators

8 papers

cs.IT2026

Generalized Extended Codes with Applications in Entanglement-Assisted Qubit and Qutrit Codes

Yang Li, Martianus Frederic Ezerman, Shitao Li +2

We prove that any generalized extended code is monomially equivalent to the Hermitian dual of a code which is closely related to a second kind of extended code of $\C^{\perp_{\rm H…

cs.IT2025

Properties and Decoding of Twisted GRS Codes and Their Extensions

Yang Li, Martianus Frederic Ezerman, Huimin Lao +1

Maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes are called non-GRS MDS codes. Alongside near MDS (NMDS) codes, they are appli…

quant-ph2024★ 10 cited

Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes

Martianus Frederic Ezerman, Markus Grassl, San Ling +2

Quasi-twisted codes are used here as the classical ingredients in the so-called Construction X for quantum error-control codes. The construction utilizes nearly self-orthogonal cod…

cs.IT2024

On Linear Codes Whose Hermitian Hulls are MD

Gaojun Luo, Lin Sok, Martianus Frederic Ezerman +1

Hermitian hulls of linear codes are interesting for theoretical and practical reasons alike. In terms of recent application, linear codes whose hulls meet certain conditions have b…

cs.IT2023★ 1 cited

Bounds and Constructions of Quantum Locally Recoverable Codes from Quantum CSS Codes

Gaojun Luo, Bocong Chen, Martianus Frederic Ezerman +1

Classical locally recoverable codes (LRCs) have become indispensable in distributed storage systems. They provide efficient recovery in terms of localized errors. Quantum LRCs have…

cs.IT2023

Improved Spectral Bound for Quasi-Cyclic Codes

Gaojun Luo, Martianus Frederic Ezerman, San Ling +1

Spectral bounds form a powerful tool to estimate the minimum distances of quasi-cyclic codes. They generalize the defining set bounds of cyclic codes to those of quasi-cyclic codes…

cs.IT2023

A Construction of Asymptotically Optimal Cascaded CDC Schemes via Combinatorial Designs

Yingjie Cheng, Gaojun Luo, Xiwang Cao +2

A coded distributed computing (CDC) system aims to reduce the communication load in the MapReduce framework. Such a system has nodes, input files, and Reduce functions.…

cs.CR2008★ 295 cited

Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes

Zhifang Zhang, Mulan Liu, Yeow Meng Chee +2

Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multiparty computation protocols. However, it remains open whether or…