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 条
  • [41] Perfect codes in direct graph bundles
    Ladinek, Irena Hrastnik
    Zerovnik, Janez
    INFORMATION PROCESSING LETTERS, 2015, 115 (09) : 707 - 711
  • [42] On the parameterized vertex cover problem for graphs with perfect matching
    Wang JianXin
    Li WenJun
    Li ShaoHua
    Chen JianEr
    SCIENCE CHINA-INFORMATION SCIENCES, 2014, 57 (07) : 1 - 12
  • [43] Perfect codes on the Towers of Hanoi graph
    Li, CK
    Nelson, T
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 1998, 57 (03) : 367 - 376
  • [44] Solving Graph Isomorphism Using Parameterized Matching
    Mendivelso, Juan
    Kim, Sunghwan
    Elnikety, Sameh
    He, Yuxiong
    Hwang, Seung-won
    Pinzon, Yoan
    STRING PROCESSING AND INFORMATION RETRIEVAL (SPIRE 2013), 2013, 8214 : 230 - 242
  • [45] Parameterized complexity of vertex deletion into perfect graph classes
    Heggernes, Pinar
    Van't Hof, Pim
    Jansen, Bart M. P.
    Kratsch, Stefan
    Villanger, Yngve
    THEORETICAL COMPUTER SCIENCE, 2013, 511 : 172 - 180
  • [46] ASSOCIATIVE-COMMUTATIVE MATCHING VIA BIPARTITE GRAPH MATCHING
    EKER, SM
    COMPUTER JOURNAL, 1995, 38 (05): : 381 - 399
  • [47] Deterministically isolating a perfect matching in bipartite planar graphs
    Datta, Samir
    Kulkarni, Rachav
    Roy, Sambuddha
    STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 229 - +
  • [48] SUBTREE ISOMORPHISM IS NC REDUCIBLE TO BIPARTITE PERFECT MATCHING
    LINGAS, A
    KARPINSKI, M
    INFORMATION PROCESSING LETTERS, 1989, 30 (01) : 27 - 32
  • [49] Template matching via bipartite graph and graph attention mechanism
    Zhao, Kai
    He, Binbing
    Lei, Wei
    Zhu, Yuan
    IET IMAGE PROCESSING, 2023, 17 (05) : 1346 - 1354
  • [50] Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
    Datta, Samir
    Kulkarni, Raghav
    Roy, Sambuddha
    THEORY OF COMPUTING SYSTEMS, 2010, 47 (03) : 737 - 757
12345