New MRD codes from linear cutting blocking sets

DOI10.1007/s10231-022-01235-5OpenAlexW4285588649MaRDI QIDQ2678900

Yanyan Li

Publication date: 25 January 2023

Published in: Annali di Matematica Pura ed Applicata. Serie Quarta (Search for Journal in Brave)

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

zbMATH Keywords

MRD codesgeneralized rank weightscutting blocking sets\(q\)-systemsevasive subspacesstrong blocking sets

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combinatorial structures in finite projective spaces (51E20)

Related Items (2)

Evasive subspaces, generalized rank weights and near MRD codes ⋮ Saturating systems and the rank-metric covering radius

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new family of linear maximum rank distance codes
• On defining generalized rank weights
• 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
• Generalized weights: an anticode approach
• Theory of codes with maximum rank distance
• Bilinear forms over a finite field, with applications to coding theory
• Scattered spaces with respect to a spread in \(\text{PG}(n,q)\)
• Maximum scattered linear sets and MRD-codes
• A geometric characterisation of linear \(k\)-blocking sets
• Scattered subspaces and related codes
• Generalising the scattered property of subspaces
• Linear cutting blocking sets and minimal codes in the rank metric
• A polymatroid approach to generalized weights of rank metric codes
• On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
• Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs
• Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
• Generalized rank weights: A duality statement
• A Rank-Metric Approach to Error Control in Random Network Coding
• Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks
• Translation ovoids of orthogonal polar spaces
• Subspace evasive sets
• Maximum-rank array codes and their application to crisscross error correction
• Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
• Evasive subspaces

This page was built for publication: New MRD codes from linear cutting blocking sets