Lower Bounds on the Covering Radius of the Non-Binary and Binary Irreducible Goppa Codes

被引：3

作者：

BezzateeV, Sergey V. ^{[1
]}

Shekhunova, Natalia A. ^{[2
]}

机构：

[1] St Petersburg Natl Res Univ Informat Technol Mech, Dept Cyber Phys Syst Secur, St Petersburg 197101, Russia

[2] St Petersburg State Univ Aerosp Instrumentat, Dept Aerosp Comp & Program Syst, St Petersburg 190000, Russia

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2018年 / 64卷 / 11期

关键词：

Error-correcting codes; covering radius; lower bound; Goppa codes;

D O I：

10.1109/TIT.2018.2867839

中图分类号：

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

学科分类号：

0812 ;

摘要：

New lower hounds on the covering radius for different subclasses of irreducible Goppa codes are obtained.

引用

页码：7171 / 7177

页数：7

共 50 条

[41] An updated table of binary/ternary mixed covering codes [J].

Bertolo, R ;

Östergård, PRJ ;

Weakley, WD .

JOURNAL OF COMBINATORIAL DESIGNS, 2004, 12 (03) :157-176

[42] Relations between the covering and Newton radii of binary codes [J].

Klove, T .

DISCRETE MATHEMATICS, 2001, 238 (1-3) :81-88

[43] On the covering radii of a class of binary primitive cyclic codes [J].

Tutdere, Seher .

HACETTEPE JOURNAL OF MATHEMATICS AND STATISTICS, 2022, 51 (01) :20-26

[44] CONSTRUCTIONS, FAMILIES, AND TABLES OF BINARY LINEAR COVERING CODES [J].

DAVYDOV, AA ;

DROZHZHINALABINSKAYA, AY .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (04) :1270-1279

[45] The covering radii of a class of binary cyclic codes and some BCH codes [J].

Kavut, Selcuk ;

Tutdere, Seher .

DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (2-3) :317-325

[46] The covering radii of a class of binary cyclic codes and some BCH codes [J].

Selçuk Kavut ;

Seher Tutdere .

Designs, Codes and Cryptography, 2019, 87 :317-325

[47] WEIGHT ENUMERATORS OF MORE IRREDUCIBLE CYCLIC BINARY-CODES [J].

WARD, RL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (05) :1701-1709

[48] A [55,16,19] BINARY GOPPA CODE AND RELATED CODES HAVING LARGE MINIMUM DISTANCE [J].

CAO, HT ;

DOUGHERTY, RL ;

JANWA, H .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (05) :1432-1433

[49] Minimum Distance Optimization with Chord Edge Growth for High Girth Non-Binary LDPC Codes [J].

Han, Changcai ;

Li, Hui ;

Chen, Weigang .

ELECTRONICS, 2020, 9 (12) :1-17

[50] Lower bounds on the rotation distance of binary trees [J].

Luccio, Fabrizio ;

Enriquez, Antonio Mesa ;

Pagli, Linda .

INFORMATION PROCESSING LETTERS, 2010, 110 (21) :934-938

← 1 2 3 4 5 →