Integer sequences that are generalized weights of a linear code

07/13/2023
by   Elisa Gorla, et al.
0

Which integer sequences are sequences of generalized weights of a linear code? In this paper, we answer this question for linear block codes, rank-metric codes, and more generally for sum-rank metric codes. We do so under an existence assumption for MDS and MSRD codes. We also prove that the same integer sequences appear as sequences of greedy weights of linear block codes, rank-metric codes, and sum-rank metric codes. Finally, we characterize the integer sequences which appear as sequences of relative generalized weights (respectively, relative greedy weights) of linear block codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2019

A Polymatroid Approach to Generalized Weights of Rank Metric Codes

We consider the notion of a (q,m)-polymatroid, due to Shiromoto, and the...
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
02/20/2020

Greedy weights for matroids

We introduce greedy weights of matroids, inspired by those for linear co...
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
09/06/2022

New MRD codes from linear cutting blocking sets

Minimal rank-metric codes or, equivalently, linear cutting blocking sets...
research
02/27/2018

Coding Theory using Linear Complexity of Finite Sequences

We define a metric on F_q^n using the linear complexity of finite sequen...
research
01/31/2019

Algorithmic counting of nonequivalent compact Huffman codes

It is known that the following five counting problems lead to the same i...

Please sign up or login with your details

Forgot password? Click here to reset