Linear cutting blocking sets and minimal codes in the rank metric
From MaRDI portal
Publication:2169825
DOI10.1016/j.jcta.2022.105658zbMath1505.94086arXiv2106.12465OpenAlexW3176678390WikidataQ114162630 ScholiaQ114162630MaRDI QIDQ2169825
Alessandro Neri, Gianira N. Alfarano, Martino Borello, Alberto Ravagnani
Publication date: 30 August 2022
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.12465
Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial structures in finite projective spaces (51E20)
Related Items (11)
Small Strong Blocking Sets by Concatenation ⋮ New MRD codes from linear cutting blocking sets ⋮ Evasive subspaces, generalized rank weights and near MRD codes ⋮ Two pointsets in \(\mathrm{PG}(2,q^n)\) and the associated codes ⋮ Minimal codewords in norm-trace codes ⋮ Antipodal two-weight rank metric codes ⋮ The Projectivization Matroid of a \(\boldsymbol{q}\) -Matroid ⋮ Multi-orbit cyclic subspace codes and linear sets ⋮ Saturating systems and the rank-metric covering radius ⋮ Saturating linear sets of minimal rank ⋮ The geometry of one-weight codes in the sum-rank metric
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rank-metric codes and their duality theory
- A new family of linear maximum rank distance codes
- Lines in higgledy-piggledy arrangement
- On defining generalized rank weights
- Linear nonbinary covering codes and saturating sets in projective spaces
- Linear sets in finite projective spaces
- Maximum scattered linear sets and complete caps in Galois spaces
- A geometric approach to rank metric codes and a classification of constant weight codes
- Hamming and simplex codes for the sum-rank metric
- Generalized weights: an anticode approach
- Galois invariance, trace codes and subfield subcodes
- Theory of codes with maximum rank distance
- On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre
- Bilinear forms over a finite field, with applications to coding theory
- Normal spreads
- Scattered spaces with respect to a spread in \(\text{PG}(n,q)\)
- Linear \((q+1)\)-fold blocking sets in \(\text{PG} (2,q^4)\)
- Maximum scattered linear sets and MRD-codes
- Weight distribution of rank-metric codes
- Minimal linear codes over finite fields
- Blocking sets in translation planes
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Minimal linear codes arising from blocking sets
- Scattered subspaces and related codes
- A geometric characterization of minimal codes and their asymptotic performance
- Rank-metric codes, linear sets, and their duality
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- Connections between scattered linear sets and MRD-codes
- Isometries for rank distance and permutation group of gabidulin codes
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- The Geometry of Two-Weight Codes
- Fundamentals of Error-Correcting Codes
- Network information flow
- Linear network coding
- Minimal vectors in linear codes
- Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
- Three Combinatorial Perspectives on Minimal Codes
- Common Complements of Linear Subspaces and the Sparseness of MRD Codes
This page was built for publication: Linear cutting blocking sets and minimal codes in the rank metric
