On defining generalized rank weights

DOI10.3934/AMC.2017014zbMATH Open1357.94082arXiv1506.02865OpenAlexW3102272702MaRDI QIDQ514540FDOQ514540

Relinde Jurrius, Ruud Pellikaan

Publication date: 9 March 2017

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Abstract: This paper investigates the generalized rank weights, with a definition implied by the study of the generalized rank weight enumerator. We study rank metric codes over $L$, where $L$ is a finite Galois extension of a field $K$. This is a generalization of the case where $K=mathbb{F}_q$ and $L=mathbb{F}_{q^m}$ of Gabidulin codes to arbitrary characteristic. We show equivalence to previous definitions, in particular the ones by Kurihara-Matsumoto-Uyematsu, Oggier-Sboui and Ducoat. As an application of the notion of generalized rank weights, we discuss codes that are degenerate with respect to the rank metric.

Full work available at URL: https://arxiv.org/abs/1506.02865

Recommendations

• Generalized rank weights: A duality statement
• Generalized weights: an anticode approach
• A geometric approach to rank metric codes and a classification of constant weight codes
• A polymatroid approach to generalized weights of rank metric codes
• Rank weights for arbitrary finite field extensions

zbMATH Keywords

network codingcoding theoryrank metric codesdegenerate codesgeneralized rank weights

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Bilinear forms over a finite field, with applications to coding theory
• Theory of codes with maximum rank distance
• Codes, Arrangements and Matroids
• Isometries for rank distance and permutation group of gabidulin codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the dimension of subfield subcodes
• Galois invariance, trace codes and subfield subcodes
• 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
• Generalized rank weights: A duality statement
• Generalized weights: an anticode approach

Cited In (21)

• A polymatroid approach to generalized weights of rank metric codes
• Rank weights for arbitrary finite field extensions
• Rank error-correcting pairs
• Theory of supports for linear codes endowed with the sum-rank metric
• Some matroids related to sum-rank metric codes
• The cyclic flats of a \(q\)-matroid
• Weight spectra of Gabidulin rank-metric codes and Betti numbers
• Rank weight hierarchy of some classes of polynomial codes
• On \(q\)-Steiner systems from rank metric codes
• A geometric approach to rank metric codes and a classification of constant weight codes
• Generalized rank weights: A duality statement
• Maximum weight codewords of a linear rank-metric code
• Saturating systems and the rank-metric covering radius
• Linear cutting blocking sets and minimal codes in the rank metric
• Evasive subspaces, generalized rank weights and near MRD codes
• \(q\)-polymatroids and their relation to rank-metric codes
• On the generalised rank weights of quasi-cyclic codes
• Higher-degree symmetric rank-metric codes
• Rank-metric codes and \(q\)-polymatroids
• New MRD codes from linear cutting blocking sets
• Defining the \(q\)-analogue of a matroid

This page was built for publication: On defining generalized rank weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514540)