Parameterized codes associated to the edges of some subgraphs of a simple graph

被引：2
|
作者：
Gonzalez Sarabia, Manuel [1 ]
Sarmiento Rosales, Eliseo [2 ]
机构：
[1] UPIITA, Inst Politecn Nacl, Dept Ciencias Basicas, Mexico City 07340, DF, Mexico
[2] ESFM, Inst Politecn Nacl, Dept Matemat, Mexico City 07300, DF, Mexico
来源：
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING | 2015年 / 26卷 / 06期
关键词：
Toric set; Parameterized code; Hilbert function; Minimum distance; Generalized Hamming weights; Regularity index; VANISHING IDEALS;
D O I：
10.1007/s00200-015-0262-7
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper we establish bounds for the main parameters of parameterized codes associated to the edges of a simple graph by using the relationships among these parameters and the corresponding ones of the parameterized codes associated to the edges of any subgraph of . These inequalities are used to find bounds in the case of complete r-partite graphs.
引用
收藏
页码：493 / 505
页数：13
相关论文
共 50 条
  • [1] Parameterized codes associated to the edges of some subgraphs of a simple graph
    Manuel González Sarabia
    Eliseo Sarmiento Rosales
    Applicable Algebra in Engineering, Communication and Computing, 2015, 26 : 493 - 505
  • [2] Codes parameterized by the edges of a bipartite graph with a perfect matching
    Sarabia, Manuel Gonzalez
    Villarreal, Rafael H.
    ANALELE STIINTIFICE ALE UNIVERSITATII OVIDIUS CONSTANTA-SERIA MATEMATICA, 2023, 31 (02): : 85 - 100
  • [3] Binary codes of some strongly regular subgraphs of the McLaughlin graph
    Dimitri Leemans
    B. G. Rodrigues
    Designs, Codes and Cryptography, 2013, 67 : 93 - 109
  • [4] Binary codes of some strongly regular subgraphs of the McLaughlin graph
    Leemans, Dimitri
    Rodrigues, B. G.
    DESIGNS CODES AND CRYPTOGRAPHY, 2013, 67 (01) : 93 - 109
  • [5] Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph
    Dubinin, N. A.
    Neustroeva, E. A.
    Raigorodskii, A. M.
    Shubin, Ya. K.
    SBORNIK MATHEMATICS, 2024, 215 (05) : 634 - 657
  • [6] Estimate of the Number of Edges in Subgraphs of a Johnson Graph
    Pushnyakov, F. A.
    Raigorodskii, A. M.
    DOKLADY MATHEMATICS, 2021, 104 (01) : 193 - 195
  • [7] Covering the edges of a graph by three odd subgraphs
    Matrai, Tamas
    JOURNAL OF GRAPH THEORY, 2006, 53 (01) : 75 - 82
  • [8] Estimate of the Number of Edges in Subgraphs of a Johnson Graph
    F. A. Pushnyakov
    A. M. Raigorodskii
    Doklady Mathematics, 2021, 104 : 193 - 195
  • [9] CROSSING-CRITICAL EDGES AND KURATOWSKI SUBGRAPHS OF A GRAPH
    SIRAN, J
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1983, 35 (02) : 83 - 92
  • [10] Estimate of the Number of Edges in Special Subgraphs of a Distance Graph
    Pushnyakov, F. A.
    Raigorodskii, A. M.
    MATHEMATICAL NOTES, 2020, 107 (1-2) : 322 - 332
12345