A Polymatroid Approach to Generalized Weights of Rank Metric Codes

04/03/2019
by   Sudhir R. Ghorpade, et al.
0

We consider the notion of a (q,m)-polymatroid, due to Shiromoto, and the more general notion of (q,m)-demi-polymatroid, and show how generalized weights can be defined for them. Further, we establish a duality for these weights analogous to Wei duality for generalized Hamming weights of linear codes. The corresponding results of Ravagnani for Delsarte rank metric codes, and Martinez-Penas and Matsumoto for relative generalized rank weights are derived as a consequence.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/28/2021

Optimal anticodes, MSRD codes, and generalized weights in the sum-rank metric

Sum-rank metric codes have recently attracted the attention of many rese...
research
07/13/2023

Integer sequences that are generalized weights of a linear code

Which integer sequences are sequences of generalized weights of a linear...
research
11/27/2020

A Galois Connection Approach to Wei-Type Duality Theorems

In 1991, Wei proved a duality theorem that established an interesting co...
research
02/20/2020

Greedy weights for matroids

We introduce greedy weights of matroids, inspired by those for linear co...
research
12/06/2018

Generalizations of Laver tables

We shall generalize the notion of a Laver table to algebras which may ha...
research
02/07/2019

Rank-metric codes

This is a chapter of the upcoming "A Concise Encyclopedia of Coding Theo...
research
09/07/2023

LRCs: Duality, LP Bounds, and Field Size

We develop a duality theory of locally recoverable codes (LRCs) and appl...

Please sign up or login with your details

Forgot password? Click here to reset