DeepAI AI Chat
Log In Sign Up

An Assmus-Mattson Theorem for Rank Metric Codes

by   Eimear Byrne, et al.
University College Dublin

A t-(n,d,λ) design over F_q, or a subspace design, is a collection of d-dimensional subspaces of F_q^n, called blocks, with the property that every t-dimensional subspace of F_q^n is contained in the same number λ of blocks. A collection of matrices in over F_q is said to hold a subspace design if the set of column spaces of its elements forms the blocks of a subspace design. We use notions of puncturing and shortening of rank metric codes and the rank-metric MacWilliams identities to establish conditions under which the words of a given rank in a linear rank metric code hold a subspace design.


page 1

page 2

page 3

page 4


Divisible linear rank metric codes

A subspace of matrices over 𝔽_q^e^m× n can be naturally embedded as a su...

Degenerate flag varieties in network coding

Building upon the application of flags to network coding introduced by L...

New Constructions of Subspace Codes Using Subsets of MRD codes in Several Blocks

A basic problem for the constant dimension subspace coding is to determi...

On subspace designs

The aim of this paper is to investigate the theory of subspace designs, ...

Short rank-metric codes and scattered subspaces

By exploiting the connection between scattered 𝔽_q-subspaces of 𝔽_q^m^3 ...

Shrunk subspaces via operator Sinkhorn iteration

A recent breakthrough in Edmonds' problem showed that the noncommutative...

On the Existence of Coproducts in Categories of q-Matroids

q-Matroids form the q-analogue of classical matroids. In this paper we i...