Name
Abstract | ||
|---|---|---|
We give formulas, in terms of graph theoretical invariants, for the minimum distance and the generalized Hamming weights of the linear code generated by the rows of the incidence matrix of a signed graph over a finite field, and for those of its dual code. Then we determine the regularity of the ideals of circuits and cocircuits of a signed graph, and prove an algebraic formula in terms of the multiplicity for the frustration index of an unbalanced signed graph. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s10623-019-00683-0 | Designs, Codes and Cryptography |
Keywords | Field | DocType |
Generalized Hamming weight, Incidence matrix, Linear code, Signed graph, Vector matroid, Edge connectivity, Frustration index, Circuit, Cycle, Regularity, Multiplicity, Primary 94B05, Secondary 94C15, 05C40, 05C22, 13P25 | Hamming code,Discrete mathematics,Finite field,Signed graph,Algebraic number,Invariant (mathematics),Linear code,Incidence matrix,Mathematics,Dual code | Journal |
Volume | Issue | ISSN |
88 | 2 | 0925-1022 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| José Martínez-Bernal | 1 | 0 | 1.35 |
| Miguel A. Valencia-Bucio | 2 | 0 | 0.68 |
| Rafael H. Villarreal | 3 | 75 | 15.69 |