ID codes in cartesian products of cliques

被引:0
|
作者
Dept of Mathematical Sciences, Clemson University, Clemson SC 29634, United States [1 ]
机构
来源
J. Comb. Math. Comb. Comp. | 2013年 / 97-106期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
10
引用
收藏
相关论文
共 50 条
  • [1] List-distinguishing Cartesian products of cliques
    Ferrara, Michael
    Furedi, Zoltan
    Jahanbekam, Sogol
    Wenger, Paul S.
    [J]. DISCRETE MATHEMATICS, 2019, 342 (07) : 2012 - 2022
  • [2] Identifying codes of Cartesian product of two cliques of the same size
    Gravier, S.
    Moncel, J.
    Semri, A.
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01):
  • [3] On perfect codes in Cartesian products of graphs
    Mollard, Michel
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2011, 32 (03) : 398 - 403
  • [4] Perfect codes in Cartesian products of 2-paths and infinite paths
    Dorbec, P
    Mollard, M
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2005, 12 (01):
  • [5] Affine cartesian codes
    Lopez, Hiram H.
    Renteria-Marquez, Carlos
    Villarreal, Rafael H.
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2014, 71 (01) : 5 - 19
  • [6] Affine cartesian codes
    Hiram H. López
    Carlos Rentería-Márquez
    Rafael H. Villarreal
    [J]. Designs, Codes and Cryptography, 2014, 71 : 5 - 19
  • [7] On maximal cliques in the graph of simplex codes
    Mariusz Kwiatkowski
    Mark Pankov
    [J]. Journal of Geometry, 2024, 115
  • [8] On maximal cliques in the graph of simplex codes
    Kwiatkowski, Mariusz
    Pankov, Mark
    [J]. JOURNAL OF GEOMETRY, 2024, 115 (01)
  • [9] Logarithm Cartesian authentication codes
    Sze, TW
    Chanson, S
    Ding, C
    Helleseth, T
    Parker, MG
    [J]. INFORMATION AND COMPUTATION, 2003, 184 (01) : 93 - 108
  • [10] On the construction of Cartesian authentication codes
    Ma, Wenping
    Wang, Xinmei
    [J]. Tien Tzu Hsueh Pao/Acta Electronica Sinica, 1999, 27 (05): : 33 - 35