\(q\)-polymatroids and their relation to rank-metric codes
From MaRDI portal
Publication:2082523
DOI10.1007/s10801-022-01129-yOpenAlexW3154643878MaRDI QIDQ2082523
Heide Gluesing-Luerssen, Benjamin Jany
Publication date: 4 October 2022
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.06570
Related Items (6)
Weighted subspace designs from \(q\)-polymatroids ⋮ Some matroids related to sum-rank metric codes ⋮ The Projectivization Matroid of a \(\boldsymbol{q}\) -Matroid ⋮ Coproducts in categories of \(q\)-matroids ⋮ The direct sum of \(q\)-matroids ⋮ Critical problem for a \(q\)-analogue of polymatroids
Cites Work
- Unnamed Item
- Rank-metric codes and their duality theory
- On defining generalized rank weights
- Wei-type duality theorems for rank metric codes
- Generalized weights: an anticode approach
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Defining the \(q\)-analogue of a matroid
- Codes with the rank metric and matroids
- Constructions of new \(q\)-cryptomorphisms
- Rank-metric codes and \(q\)-polymatroids
- A polymatroid approach to generalized weights of rank metric codes
- Higher support matroids
- Independent spaces of \(q\)-polymatroids
- Codes, Arrangements and Matroids
- ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
- Rank-metric codes
- Code Enumerators and Tutte Polynomials
- Covering Radius of Matrix Codes Endowed with the Rank Metric
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: \(q\)-polymatroids and their relation to rank-metric codes