Linear rank-metric intersecting codes
Preprint
Abstract
In this paper we introduce and investigate rank-metric intersecting codes, a new class of linear codes in the rank-metric context, inspired by the well-studied notion of intersecting codes in the Hamming metric. A rank-metric code is said to be intersecting if any two nonzero codewords have supports intersecting non trivially. We explore this class from both a coding-theoretic and geometric perspective, highlighting its relationship with minimal codes, MRD codes, and Hamming-metric intersecting codes. We derive structural properties, sufficient conditions based on minimum distance, and geometric characterizations in terms of 2-spannable $q$-systems. We establish upper and lower bounds on code parameters and show some constructions, which leave a range of unexplored parameters. Finally, we connect rank-intersecting codes to other combinatorial structures such as $(2,1)$-separating systems and frameproof codes.Keywords
All Related Versions
This publication has 28 references indexed in Scilit:
- Saturating systems and the rank-metric covering radiusJournal of Algebraic Combinatorics, 2023
- Evasive subspaces, generalized rank weights and near MRD codesDiscrete Mathematics, 2023
- Weight distribution of rank-metric codesDesigns, Codes and Cryptography, 2017
- (2, 1)-Separating systems beyond the probabilistic boundIsrael Journal of Mathematics, 2012
- Linear sets in finite projective spacesDiscrete Mathematics, 2010
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- On the extremal combinatorics of the hamming spaceJournal of Combinatorial Theory, Series A, 1995
- Linear binary codes with intersection propertiesDiscrete Applied Mathematics, 1984
- Minimal 2-coverings of a finite affine space based on GF(2)Journal of Statistical Planning and Inference, 1983
- Curve razionali normali ek-archi negli spazi finitiAnnali di Matematica Pura ed Applicata (1923 -), 1955