A geometric approach to rank metric codes and a classification of constant weight codes
From MaRDI portal
Publication:780374
DOI10.1007/s10623-020-00750-xzbMath1450.94053arXiv1907.04372OpenAlexW3011655850MaRDI QIDQ780374
Tovohery Hajatiana Randrianarisoa
Publication date: 15 July 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.04372
classificationgeometric approachlinear codecoding theorylinear setsrank metric codesconstant rank weight
Related Items
On the list decodability of rank-metric codes containing Gabidulin codes, Linear cutting blocking sets and minimal codes in the rank metric, Weighted subspace designs from \(q\)-polymatroids, New MRD codes from linear cutting blocking sets, Cones from maximum \(h\)-scattered linear sets and a stability result for cylinders from hyperovals, Evasive subspaces, generalized rank weights and near MRD codes, Antipodal two-weight rank metric codes, Multi-orbit cyclic subspace codes and linear sets, Saturating systems and the rank-metric covering radius, The \(t\)-wise intersection and trellis of relative four-weight codes, Scattered subspaces and related codes, The geometry of one-weight codes in the sum-rank metric
Cites Work
- Unnamed Item
- Unnamed Item
- A new family of linear maximum rank distance codes
- On defining generalized rank weights
- MRD-codes and linear sets
- Linear sets in finite projective spaces
- Notes on the value function
- Generalized weights: an anticode approach
- Theory of codes with maximum rank distance
- The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
- Caps and codes
- Bilinear forms over a finite field, with applications to coding theory
- Normal spreads
- Maximum scattered linear sets and MRD-codes
- A characterization of linearized polynomials with maximum kernel
- Rank-metric codes, linear sets, and their duality
- Identifiers for MRD-codes
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- Generalized rank weights: A duality statement
- Field reduction and linear sets in finite geometry
- Generalized Hamming weights for linear codes
- Geometric approach to higher weights
- New semifields and new MRD codes from skew polynomial rings
- Secure Network Coding on a Wiretap Network
- Wire-Tap Channel II
