Covering radius of matrix codes endowed with the rank metric
From MaRDI portal
Publication:5346567
DOI10.1137/16M1091769zbMATH Open1395.94374MaRDI QIDQ5346567FDOQ5346567
Authors: Eimear Byrne, Alberto Ravagnani 
Publication date: 24 May 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
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. We apply the various bounds to the classes of maximal rank distance and quasi maximal rank distance codes.
Full work available at URL: https://arxiv.org/abs/1608.08755
Recommendations
Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new family of linear maximum rank distance codes
- Association schemes and t-designs in regular semilattices
- Bilinear forms over a finite field, with applications to coding theory
- Coding and Cryptography
- Combinatorial matrix theory
- Covering radius 1985-1994
- Covering radius---Survey and recent results
- Duality of codes supported on regular lattices, with an application to enumerative combinatorics
- Fast decoding of Gabidulin codes
- Four fundamental parameters of a code and their combinatorial significance
- Maximum-rank array codes and their application to crisscross error correction
- ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
- On the Covering Radius of MDS Codes
- On the Non - Existence of Perfect Codes with Rank Distance
- Packing and Covering Properties of Rank Metric Codes
- Rank-metric codes and their duality theory
- The complexity of the covering radius problem
- Theory of codes with maximum rank distance
- Weight distribution of rank-metric codes
- Weight distribution of translates of MDS codes
Cited In (17)
- Packing and Covering Properties of Rank Metric Codes
- Tensor representation of rank-metric codes
- Saturating linear sets in \(\mathrm{PG}(2,q^4)\)
- Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
- Theory of supports for linear codes endowed with the sum-rank metric
- An Assmus-Mattson theorem for rank metric codes
- Multi-covering radius for rank metric codes
- Puncturing maximum rank distance codes
- Saturating linear sets of minimal rank
- Scattered subspaces and related codes
- Saturating systems and the rank-metric covering radius
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- \(q\)-polymatroids and their relation to rank-metric codes
- Rank-metric codes and \(q\)-polymatroids
- Non-linear MRD codes from cones over exterior sets
- Rank-metric codes and their applications
- Rank metric codes and zeta functions
This page was built for publication: Covering radius of matrix codes endowed with the rank metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346567)
