A Family of Codes With Locality Containing Optimal Codes

被引：1

作者：

Andrade, Bruno ^{[1
]}

Carvalho, Cicero ^{[1
]}

Neumann, Victor G. L. ^{[1
]}

Veiga, Antonio C. P. ^{[2
]}

机构：

[1] Univ Fed Uberlandia, Fac Matemat, BR-38408902 Uberlandia, MG, Brazil

[2] Univ Fed Uberlandia, Fac Engn Elect, BR-38408902 Uberlandia, MG, Brazil

来源：

IEEE ACCESS | 2022年 / 10卷

关键词：

Codes; Upper bound; Licenses; Frequency modulation; Codecs; Locally recoverable codes; affine cartesian codes; REPAIRABLE CODES; WEIGHT;

D O I：

10.1109/ACCESS.2022.3165032

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Locally recoverable codes were introduced by Gopalan et al. in 2012, and in the same year Prakash et al. introduced the concept of codes with locality, which are a type of locally recoverable codes. In this work we introduce a new family of codes with locality, which are subcodes of a certain family of evaluation codes. We determine the dimension of these codes, and also bounds for the minimum distance. We present the true values of the minimum distance in special cases, and also show that some elements of this family are "optimal codes", as defined by Prakash et al.

引用

页码：39145 / 39153

页数：9

共 50 条

[21] On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes [J].

Cai, Han ;

Schwartz, Moshe .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (02) :686-704

[22] On Lengths of Singleton-Optimal Locally Repairable Codes [J].

Liu, Shu ;

Wu, Ting-Yi ;

Xing, Chaoping ;

Yuan, Chen .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2024, 72 (01) :3-12

[23] On the Linear Codes with (r, δ)-locality for Distributed Storage [J].

Hao, Jie ;

Xia, Shu-Tao ;

Chen, Bin .

2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2017,

[24] Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes [J].

Ji, Qinqin ;

Zheng, Dabin ;

Chen, Hao ;

Wang, Xiaoqiang .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (05) :2900-2910

[25] Optimal RS Codes and GRS Codes Against Adversarial Insertions and Deletions and Optimal Constructions [J].

Liu, Jingge .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (09) :6269-6279

[26] Optimal, Almost Optimal Few-Weight Linear Codes and Related Quantum Codes [J].

Xie, Conghui ;

Chen, Hao ;

Zhou, Haiyan ;

Li, Yang ;

Lao, Huimin .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2025, 71 (06) :4250-4259

[27] Near Optimal Probabilistic Constructions of Frameproof Codes [J].

Liu, Miao ;

Ma, Zengjiao ;

Chong, Shangguan .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2025, 71 (06) :4137-4144

[28] Robust Gray Codes Approaching the Optimal Rate [J].

Con, Roni ;

Fathollahi, Dorsa ;

Gabrys, Ryan ;

Wootters, Mary ;

Yaakobi, Eitan .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2025, 71 (03) :1647-1665

[29] Codes with hierarchical locality on Artin-Schreier surfaces [J].

Berg, Jennifer ;

Malmskog, Beth ;

West, Mckenzie .

JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2025,

[30] Enumeration of Optimal Equidistant Codes [J].

Bogdanova, Galina ;

Todorov, Todor .

MATHEMATICS, 2022, 10 (05)

← 1 2 3 4 5 →