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 条
  • [21] Existence of a perfect matching in a random (1+e-1)-out bipartite graph
    Karonski, M
    Pittel, B
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2003, 88 (01) : 1 - 16
  • [22] ON THE NUMBER OF PERFECT MATCHINGS IN A BIPARTITE GRAPH
    de Carvalho, Marcelo H.
    Lucchesi, Claudio L.
    Murty, U. S. R.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (02) : 940 - 958
  • [23] The number of edges in a bipartite graph of given radius
    Dankelmann, P.
    Swart, Henda C.
    van den Berg, P.
    DISCRETE MATHEMATICS, 2011, 311 (8-9) : 690 - 698
  • [24] On edges not in monochromatic copies of a fixed bipartite graph
    Ma, Jie
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 123 : 240 - 248
  • [25] Successive partition of edges of bipartite graph into matchings
    Magomedov, Abdulkarim M.
    Magomedov, Tagir A.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2016, 26 (06): : 347 - 353
  • [26] Obtaining a Bipartite Graph by Contracting Few Edges
    Heggernes, Pinar
    van 't Hof, Pim
    Lokshtanov, Daniel
    Paul, Christophe
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 217 - 228
  • [27] OBTAINING A BIPARTITE GRAPH BY CONTRACTING FEW EDGES
    Heggernes, Pinar
    Van 'T Hof, Pim
    Lokshtanov, Daniel
    Paul, Christophe
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (04) : 2143 - 2156
  • [28] Bandwidth of refinement on all edges of bipartite graph
    Lai, YL
    Ron, DT
    ISAS/CITSA 2004: International Conference on Cybernetics and Information Technologies, Systems and Applications and 10th International Conference on Information Systems Analysis and Synthesis, Vol 3, Proceedings, 2004, : 275 - 280
  • [29] A PERFECT MATCHING ALGORITHM FOR SPARSE BIPARTITE GRAPHS
    TOCZYLOWSKI, E
    DISCRETE APPLIED MATHEMATICS, 1984, 9 (03) : 263 - 268
  • [30] Bipartite Perfect Matching Is in Quasi-NC
    Fenner, Stephen
    Gurjar, Rohit
    Thierauf, Thomas
    STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 754 - 763
12345