Parameterized codes over graphs

12/14/2021
by   Jorge Neves, et al.
0

In this article we review known results on parameterized linear codes over graphs, introduced by Rentería, Simis and Villarreal in 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2020

Introducing Three Best Known Goppa Codes

The current best known [239, 21], [240, 21], and [241, 21] binary li...
research
04/20/2019

Linear codes over signed graphs

We give formulas, in terms of graph theoretical invariants, for the mini...
research
06/25/2019

On The Dimension of The Subfield Subcodes of 1-Point Hermitian Codes

Subfield subcodes of algebraic-geometric codes are good candidates for t...
research
09/01/2022

Generalized k-Center: Distinguishing Doubling and Highway Dimension

We consider generalizations of the k-Center problem in graphs of low dou...
research
07/18/2019

MRD-codes arising from the trinomial x^q+x^q^3+cx^q^5∈F_q^6[x]

In [10], the existence of F_q-linear MRD-codes of F_q^6× 6, with dimensi...
research
12/19/2017

Dimension of nonbinary antiprimitive BCH codes

Bose-Chaudhuri-Hocquenghem (BCH) codes have been widely employed in sate...
research
02/03/2023

Improving the dimension bound of Hermitian Lifted Codes

In this article we improve the dimension and minimum distance bound of t...

Please sign up or login with your details

Forgot password? Click here to reset