COVERING RADIUS OF MATRIX CODES ENDOWED WITH THE RANK METRIC

被引：17

作者：

Byrne, Eimear ^{[1
]}

Ravagnani, Alberto ^{[2
]}

机构：

[1] Univ Coll Dublin, Sch Math & Stat, Dublin, Ireland

[2] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON M5S 3G4, Canada

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 2017年 / 31卷 / 02期

基金：

瑞士国家科学基金会;

关键词：

rank-metric code; matrix code; covering radius; weight distribution;

D O I：

10.1137/16M1091769

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper we study properties and invariants of matrix codes endowed with the rank metric and relate them to the covering radius. We introduce new tools for the analysis of rank-metric codes, such as puncturing and shortening constructions. We give upper bounds on the covering radius of a code by applying different combinatorial methods. The various bounds are then applied to the classes of maximal-rank-distance and quasi-maximal-rank-distance codes.

引用

页码：927 / 944

页数：18

共 50 条

[11] A note on covering radius of MacDonald codes
Bhandari, MC
Durairajan, C
ITCC 2003: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: COMPUTERS AND COMMUNICATIONS, PROCEEDINGS, 2003, : 221 - 225
[12] More on the covering radius of BCH codes
LevyditVehel, F
Litsyn, S
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (03) : 1023 - 1028
[13] Linear codes with covering radius 3
Alexander A. Davydov
Patric R. J. Östergård
Designs, Codes and Cryptography, 2010, 54 : 253 - 271
[14] Codes with the rank metric and matroids
Keisuke Shiromoto
Designs, Codes and Cryptography, 2019, 87 : 1765 - 1776
[15] Codes with the rank metric and matroids
Shiromoto, Keisuke
DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (08) : 1765 - 1776
[16] THE COVERING RADIUS OF HADAMARD CODES IN ODD GRAPHS
SOLE, P
GHAFOOR, A
SHEIKH, SA
DISCRETE APPLIED MATHEMATICS, 1992, 37-8 : 501 - 510
[17] A New Class of Rank-Metric Codes and Their List Decoding Beyond the Unique Decoding Radius
Xing, Chaoping
Yuan, Chen
IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (05) : 3394 - 3402
[18] A random construction for permutation codes and the covering radius
Peter Keevash
Cheng Yeaw Ku
Designs, Codes and Cryptography, 2006, 41 : 79 - 86
[19] A random construction for permutation codes and the covering radius
Keevash, Peter
Ku, Cheng Yeaw
DESIGNS CODES AND CRYPTOGRAPHY, 2006, 41 (01) : 79 - 86
[20] Asymptotic minimum covering radius of block codes
Chen, PN
Han, YSS
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2001, 14 (04) : 549 - 564

← 1 2 3 4 5 →