Latroids and code invariants
By: Elisa Gorla, Flavio Salizzoni
Potential Business Impact:
Finds hidden patterns in codes for better data.
Latroids were introduced by Vertigan, who associated a latroid to a linear block code and showed that its Tutte polynomial determines the weight enumerator of the code. We associate a latroid to a code over a ring or a field endowed with a general support function, and show that the generalized weights of the code can be recovered from the associated latroid. This provides a uniform framework for studying generalized weights of linear block codes, linear codes over a ring, rank-metric and sum-rank metric codes. Under suitable assumptions, we show that the latroid determines the weight distribution of the code.
Similar Papers
Polynomial Invariants of q-Matroids and Rank-Metric Codes
Combinatorics
Links math ideas to computer code.
On an analogue of the doubling method in coding theory
Number Theory
Creates new math tools for understanding complex codes.
Code distances: a new family of invariants of linear codes
Information Theory
Helps sort and understand secret codes better.