Codes parameterized by the edges of a bipartite graph with a perfect matching

被引：0
|
作者：
Sarabia, Manuel Gonzalez [1 ,2 ,3 ]
Villarreal, Rafael H. [3 ,4 ]
机构：
[1] Inst Politecn Nacl, UPIITA, Av IPN 2580, Ciudad De Mexico 07340, Mexico
[2] COFAA IPN, Dept Ciencias Bas, Mexico City, Mexico
[3] SNI, Mexico City, Mexico
[4] Ctr Invest & Estudios Avanzados IPN, Dept Matemat, Apartado Postal 14-740, Mexico City 07000, Mexico
来源：
ANALELE STIINTIFICE ALE UNIVERSITATII OVIDIUS CONSTANTA-SERIA MATEMATICA | 2023年 / 31卷 / 02期
关键词：
Parameterized code; Bipartite graph; Perfect matching; GENERALIZED HAMMING WEIGHTS; VANISHING IDEALS;
D O I：
10.2478/auom-2023-0021
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.
引用
收藏
页码：85 / 100
页数：16
相关论文
共 50 条
  • [1] THE MOST VITAL EDGES OF MATCHING IN A BIPARTITE GRAPH
    HUNG, CN
    HSU, LH
    SUNG, TY
    NETWORKS, 1993, 23 (04) : 309 - 313
  • [2] Boolean matching algorithm based on the perfect matching of the bipartite graph
    Lu, ZW
    Lin, ZH
    Lei, Z
    2001 4TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS, 2001, : 150 - 154
  • [3] An addendum to the most vital edges of matching in a bipartite graph
    Volgenant, A
    NETWORKS, 1996, 27 (03) : 253 - 253
  • [4] Parameterized codes associated to the edges of some subgraphs of a simple graph
    Gonzalez Sarabia, Manuel
    Sarmiento Rosales, Eliseo
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2015, 26 (06) : 493 - 505
  • [5] 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
  • [6] Perfect matching in bipartite hypergraphs subject to a demand graph
    Lior Aronshtam
    Hagai Ilani
    Elad Shufan
    Annals of Operations Research, 2023, 321 : 39 - 48
  • [7] Best odds for finding a perfect matching in a bipartite graph
    Paulsen, W.
    COMBINATORICS PROBABILITY & COMPUTING, 2006, 15 (05): : 753 - 763
  • [8] Perfect matching in bipartite hypergraphs subject to a demand graph
    Aronshtam, Lior
    Ilani, Hagai
    Shufan, Elad
    ANNALS OF OPERATIONS RESEARCH, 2023, 321 (1-2) : 39 - 48
  • [9] Perfect matching essential edges in balanced bipartite graphs by edge augmentation
    2013, Centre for Environment Social and Economic Research, Post Box No. 113, Roorkee, 247667, India (51):
  • [10] Boolean mapping algorithm based on perfect matching of bipartite graph
    Lu, Z.-W.
    Lin, Z.-H.
    Zhang, L.
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2001, 13 (11): : 961 - 965
12345