Covering Radius of Matrix Codes Endowed with the Rank Metric

Files in This Item:
 File SizeFormat
Downloadfinal_SIAM.pdf252.84 kBAdobe PDF
Title: Covering Radius of Matrix Codes Endowed with the Rank Metric
Authors: Byrne, EimearRavagnani, Alberto
Permanent link:
Date: 23-May-2017
Online since: 2017-10-10T11:38:55Z
Abstract: 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.
Funding Details: Swiss National Science Foundation
Type of material: Journal Article
Publisher: Society for Industrial and Applied Mathematics
Journal: SIAM Journal on Discrete Mathematics
Volume: 31
Issue: 2
Start page: 927
End page: 944
Copyright (published version): 2017 Society for Industrial and Applied Mathematics
Keywords: Rank metric codeCovering radiusRank distance distributionRank coset weightsExternal distance boundDual distance boundInitial set bound
DOI: 10.1137/16M1091769
Language: en
Status of Item: Peer reviewed
This item is made available under a Creative Commons License:
Appears in Collections:Mathematics and Statistics Research Collection

Show full item record

Citations 50

Last Week
Last month
checked on Sep 11, 2020

Page view(s)

Last Week
Last month
checked on Jul 2, 2022


checked on Jul 2, 2022

Google ScholarTM



If you are a publisher or author and have copyright concerns for any item, please email and the item will be withdrawn immediately. The author or person responsible for depositing the article will be contacted within one business day.