Partitions of matrix spaces with an application to \(q\)-rook polynomials
DOI10.1016/j.ejc.2020.103120zbMath1473.94138arXiv1811.01282OpenAlexW3021927480MaRDI QIDQ2198967
Alberto Ravagnani, Heide Gluesing-Luerssen
Publication date: 15 September 2020
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.01282
matrix spacecode extremalitygeneralization of Singleton-like bound for rank-metric codesKrawtchouk coefficientsMacWilliams-type identitiespivot partitionq-rook polynomialsrow-space partition
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Combinatorial codes (94B25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rank-metric codes and their duality theory
- Partitions of Frobenius rings induced by the homogeneous weight
- MacWilliams extension theorems and the local-global property for codes over Frobenius rings
- The Bruhat decomposition, Tits system and Iwahori ring for the monoid of matrices over a finite field
- Theory of codes with maximum rank distance
- Q-counting rook configurations and a formula of Frobenius
- Bilinear forms over a finite field, with applications to coding theory
- \(q\)-rook polynomials and matrices over finite fields
- Counting points on varieties over finite fields related to a conjecture of Kontsevich
- External flats to varieties in \(\mathbb{P}\mathbb{G}(\bigwedge^2(V))\) over finite fields
- Hermitian rank distance codes
- Duality of codes supported on regular lattices, with an application to enumerative combinatorics
- Defining the \(q\)-analogue of a matroid
- Codes with the rank metric and matroids
- Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams
- Fourier-reflexive partitions and MacWilliams identities for additive codes
- The linear programming bound for codes over finite Frobenius rings
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- Linear Transformations on Algebras of Matrices
- A Rank-Metric Approach to Error Control in Random Network Coding
- Fundamentals of Error-Correcting Codes
- Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: Partitions of matrix spaces with an application to \(q\)-rook polynomials
