The augmented codes of a family of linear codes with locality 2

In this paper, we first generalize the class of linear codes by Ding and Ding [A class of two-weight and three-weight codes and their applications in secret sharing, IEEE Trans. Inform. Theory 61 (2015) 5835–5842, https://ieeexplore.ieee.org/document/7226827] . Then we mainly study the augmented codes of this generalized class of linear codes. For one thing, we use Gaussian sums to determine the parameters and weight distributions of the augmented codes in some cases. It is shown that the augmented codes are self-orthogonal and have only a few nonzero weights. For another thing, the locality of the augmented codes is proved to be 2, which indicates that the augmented codes are useful in distributed storage. Besides, the augmented codes are projective as the minimum distance of their duals is proved to be 3. In particular, we obtain several (almost) optimal linear codes and locally recoverable codes.

Authors

Institutions

Publication Details

Journal
Journal of Algebra and Its Applications
Published
2025-02-07
DOI
https://doi.org/10.1142/s0219498825410087
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The augmented codes of a family of linear codes with locality 2

Ziling Heng, Keqing Cao
Journal of Algebra and Its Applications
Coding theory and cryptography
article

The augmented codes of a family of linear codes with locality 2

Ziling Heng, Keqing Cao
article en

Abstract

In this paper, we first generalize the class of linear codes by Ding and Ding [A class of two-weight and three-weight codes and their applications in secret sharing, IEEE Trans. Inform. Theory 61 (2015) 5835–5842, https://ieeexplore.ieee.org/document/7226827] . Then we mainly study the augmented codes of this generalized class of linear codes. For one thing, we use Gaussian sums to determine the parameters and weight distributions of the augmented codes in some cases. It is shown that the augmented codes are self-orthogonal and have only a few nonzero weights. For another thing, the locality of the augmented codes is proved to be 2, which indicates that the augmented codes are useful in distributed storage. Besides, the augmented codes are projective as the minimum distance of their duals is proved to be 3. In particular, we obtain several (almost) optimal linear codes and locally recoverable codes.

Journal of Algebra and Its ApplicationsVol. 24(13n14)
Chang'an University (CN), Southeast University (BD)
Openalex Percentile: Top 99%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.