An Assmus--Mattson Theorem for Rank Metric Codes
From MaRDI portal
Publication:5232151
DOI10.1137/18M119183XzbMath1419.05029arXiv1806.00448MaRDI QIDQ5232151
Eimear Byrne, Alberto Ravagnani
Publication date: 29 August 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.00448
Assmus-Mattson theoremweight distributionMacWilliams identitiessubspace designrank metric codedesign over \(\mathbb{F}_{q}\)
Combinatorial aspects of block designs (05B05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25)
Related Items (5)
Further results on LCD generalized Gabidulin codes ⋮ On \(\alpha \)-points of \(q\)-analogs of the Fano plane ⋮ Weighted subspace designs from \(q\)-polymatroids ⋮ Saturating linear sets of minimal rank ⋮ Constructions of new matroids and designs over \(\mathbb{F}_q\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rank-metric codes and their duality theory
- Nontrivial \(t\)-designs over finite fields exist for all \(t\)
- Large sets of subspace designs
- Three-weight cyclic codes and their weight distributions
- Designs over finite fields
- 2-designs over \(GF(q)\)
- Bilinear forms over a finite field, with applications to coding theory
- A new family of 2-designs over GF\((q)\) admitting SL\(_m(q^l)\)
- An Assmus-Mattson-type approach for identifying 3-designs from linear codes over \(\mathbb{Z}_4\)
- On harmonic weight enumerators of binary codes
- Duality of codes supported on regular lattices, with an application to enumerative combinatorics
- On \(q\)-Steiner systems from rank metric codes
- Weight distribution of rank-metric codes
- An Assmus-Mattson theorem for codes over commutative association schemes
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- On the inequalities of \(t\)-designs over a finite field
- Infinite families of 2-designs and 3-designs from linear codes
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- A strengthening of the Assmus-Mattson theorem
- Coding for Errors and Erasures in Random Network Coding
- Fundamentals of Error-Correcting Codes
- Covering Radius of Matrix Codes Endowed with the Rank Metric
- Determining the Nonlinearity of a New Family of APN Functions
- New 5-designs
- Intersection Numbers For Subspace Designs
This page was built for publication: An Assmus--Mattson Theorem for Rank Metric Codes
