Packing and Covering Properties of Rank Metric Codes
From MaRDI portal
Abstract: This paper investigates packing and covering properties of codes with the rank metric. First, we investigate packing properties of rank metric codes. Then, we study sphere covering properties of rank metric codes, derive bounds on their parameters, and investigate their asymptotic covering properties.
Recommendations
Cited in
(26)- Design of \(\mathcal{T}\)-\textit{direct} codes over \(\mathrm{GF}(2^N)\) with increased users
- Construction of high rate \(\mathcal {T}\)-direct codes
- On deep holes of Gabidulin codes
- On the list decodability of self-orthogonal rank-metric codes
- Codes with the rank metric and matroids
- Chains of subsemigroups
- Application of \(\mathcal{T}\)-direct codes in multiple-rate codes
- Multiple-rate error-correcting coding scheme
- Linear subspaces of symmetric tensors whose non-zero elements have at least a prescribed rank
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- Multi-covering radius for rank metric codes
- Asymptotic behaviour of codes in rank metric over finite fields
- The packing radius of a poset block code
- Rank-metric codes and their duality theory
- Long packing and covering codes
- Some important results on \(\mathcal{T}\)-direct codes
- Algebraic decoding of folded Gabidulin codes
- Covering radius of matrix codes endowed with the rank metric
- Rank-metric codes and their applications
- Radon transforms and packings
- LCP of rank metric codes and its an application
- Densities of codes of various linearity degrees in translation-invariant metric spaces
- Saturating systems and the rank-metric covering radius
- Saturating linear sets of minimal rank
- Saturating linear sets in \(\mathrm{PG}(2,q^4)\)
- Generalised evasive subspaces
This page was built for publication: Packing and Covering Properties of Rank Metric Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604842)
