Parameterized codes over graphs
In this article we review known results on parameterized linear codes over graphs, introduced by Rentería et al. (Finite Fields Appl 17(1):81–104, 2011) . Very little is known about their basic parameters and invariants. We review in detail the parameters dimension, regularity and minimum distance....
Gespeichert in:
Veröffentlicht in: | São Paulo Journal of Mathematical Sciences 2023-06, Vol.17 (1), p.306-319 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this article we review known results on parameterized linear codes over graphs, introduced by Rentería et al. (Finite Fields Appl 17(1):81–104, 2011) . Very little is known about their basic parameters and invariants. We review in detail the parameters dimension, regularity and minimum distance. As regards the parameter
dimension
, we explore the connection to Eulerian ideals in the ternary case and we give new combinatorial formulas. |
---|---|
ISSN: | 1982-6907 2316-9028 2306-9028 |
DOI: | 10.1007/s40863-022-00335-7 |