Rank-Metric Codes and q-Polymatroids

03/28/2018
by   Elisa Gorla, et al.
0

We study some algebraic and combinatorial invariants of rank-metric codes, specifically generalized weights. We introduce q-polymatroids, the q-analogue of polymatroids, and develop their basic properties. We show that rank-metric codes give rise to q-polymatroids, and that several of their structural properties are captured by the associated combinatorial object.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/18/2022

Rank-Metric Lattices

We introduce the class of rank-metric geometric lattices and initiate th...
research
04/14/2021

q-Polymatroids and Their Relation to Rank-Metric Codes

It is well known that linear rank-metric codes give rise to q-polymatroi...
research
01/19/2022

Quasi optimal anticodes: structure and invariants

It is well-known that the dimension of optimal anticodes in the rank-met...
research
09/27/2018

Spanoids - an abstraction of spanning structures, and a barrier for LCCs

We introduce a simple logical inference structure we call a spanoid (gen...
research
01/29/2019

Interleaving Loidreau's Rank-Metric Cryptosystem

We propose and analyze an interleaved variant of Loidreau's rank-metric ...
research
11/03/2018

Partitions of Matrix Spaces With an Application to q-Rook Polynomials

We study the row-space partition and the pivot partition on the matrix s...
research
10/19/2022

Efficient, probabilistic analysis of combinatorial neural codes

Artificial and biological neural networks (ANNs and BNNs) can encode inp...

Please sign up or login with your details

Forgot password? Click here to reset