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 条

[31] Constructions of near MDS codes which are optimal locally recoverable codes [J].

Li, Xiaoru ;

Heng, Ziling .

FINITE FIELDS AND THEIR APPLICATIONS, 2023, 88

[32] Optimal Codes in the Class of 2-Bit Delay Decodable Codes [J].

Hashimoto, Kengo ;

Iwata, Ken-Ichi .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2025, 71 (01) :797-832

[33] Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes [J].

Lopez, Hiram H. ;

Matthews, Gretchen L. ;

Soprunov, Ivan .

DESIGNS CODES AND CRYPTOGRAPHY, 2020, 88 (08) :1673-1685

[34] A New Construction of Optimal (r, δ) Locally Recoverable Codes [J].

Zhang, Guanghui .

IEEE COMMUNICATIONS LETTERS, 2020, 24 (09) :1852-1856

[35] Optimal Locally Repairable Codes: An Improved Bound and Constructions [J].

Cai, Han ;

Fan, Cuiling ;

Miao, Ying ;

Schwartz, Moshe ;

Tang, Xiaohu .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (08) :5060-5074

[36] Some new constructions of optimal linear codes and alphabet-optimal (r, δ)-locally repairable codes [J].

Qiu, Jing ;

Fu, Fang-Wei .

DESIGNS CODES AND CRYPTOGRAPHY, 2024, 92 (10) :2971-2991

[37] Optimal Codes Correcting a Substring Edit [J].

Li, Yuting ;

Tang, Yuanyuan ;

Lou, Hao ;

Gabrys, Ryan ;

Farnoud, Farzad Hassanzadeh .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2025, 71 (07) :5178-5191

[38] A Note on Optimal Constant Dimension Codes [J].

Liao, Qunying ;

Zhu, Juan .

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (01) :143-152

[39] A New Family of Optimal Binary Few-Weight Codes From Simplicial Complexes [J].

Li, Xiaoxiao ;

Shi, Minjia .

IEEE COMMUNICATIONS LETTERS, 2021, 25 (04) :1048-1051

[40] Constructions of Optimal Binary Locally Recoverable Codes via a General Construction of Linear Codes [J].

Luo, Gaojun ;

Cao, Xiwang .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2021, 69 (08) :4987-4997

← 1 2 3 4 5 →