图cy_nk_2中r-ID码和r-LD码的界

Bound of r-Identifying and r-Locating-dominanting Codes in the Kronecker Product Graph of cy_n and k_2

下载PDF

导出

摘要 r-ID码和r-LD码与多处理系统的错误诊断有关.r-ID码和r-LD码可通过码字发送的信号确定故障处理器的具体位置.利用最短路和码球,研究了r-ID码和r-LD码两种码在张量图cynk2中的最小码字总数,并给出了码的界. An r-identifying code and an r-locating-dominating code had close relation with fault diagnosis in multiprocessor systems. An r-identifying code and an r-locating-dominating code could tell the location of the malfunctioning processor based only on the information which one of the codewords gave the alarm. By applying shortest path and ball of code, r-identifying codes and r-locating-dominating codes in the graph cyn×k2 were considered and the bounds of r-identifying codes and r-locating-dominating codes in the graph cyn×k2 were given.

作者蒲利群柴艳玲

机构地区郑州大学数学与统计学院郑州城市职业学院数学系

出处《郑州大学学报（理学版）》 CAS 北大核心 2013年第4期10-12,共3页 Journal of Zhengzhou University:Natural Science Edition

基金国家自然科学基金资助项目编号11071163

关键词 r—ID码 r-LD码张量积最小码字总数 r-ID code r-LD code kronecker product smallest cardinality

分类号 O157.2 [理学—基础数学]

引文网络
相关文献

参考文献8

1Colboum C J, Slater P J, Stewart L K. Locating dominanting sets in series parallel networks [ J ~. Congr Number, 1987,56 (2) : 135 - 162.
2Karpovsky M G, Chakrabarty K, Levitin L B. On a new class of codes for identifying vertices in graphs [ J ]. IEEE Trans Inform Theory, 1998, 44(2) : 599 -611.
3Charon I, Hudry O, Lobstein A. Identifying codes with small radius in some infinite regular graphs [ J ]. Electron J Combin, 2002, 9(1) : Rll.
4Charon I, Hudry O, Lobstein A. Minimizing the size of an identifying or locating-dominanting code in a graph is NP-hard[ J]. Theoretical Compnt Sci, 2003, 290(3) : 2109 - 2120.
5Bertrand N, Charon I, Hudry O, et al. 1-identifying codes on trees[ J ]. Austral J Combin, 2006,31 (3) :21 -35.
6Slater P J. Dominanting and reference sets in a graph[J]. J Math Phys Sci, 1998, 22(3) :445 -455.
7Bertrand N, Charon I, Hudry O, et al. Identifying and locating-dominanting codes on chains and cycles [ J ]. Electron J Combin, 2004,25 (4) : 969 - 987.
8蒲利群,艾伦.完全三部图的线图所生成的二元码[J].郑州大学学报（理学版）,2010,42(4):8-13. 被引量：1

二级参考文献11

1蒲利群,马骏.小阶数(v,5,2)-OOC码(英文)[J].郑州大学学报（理学版）,2006,38(4):1-6. 被引量：1
2Key J D,Seneviratne P. Binary codes from rectangular lattice graphs and permutation decoding[J]. European Journal of Combinatorics, 2007,28 (1) : 121-126.
3Key J D, Seneviratne P. Codes from the line graphs of complete multipartite graphs and PD-sets[J]. Discrete Mathematics, 2007,307 (1): 2217-2225.
4Key J D, Seneviratne P. Permutation decoding for the binary codes from triangular graphs[J]. European Journal of Combinatorics, 2004, 25 (1):113-123.
5Assmus E F, Key J D. Designs and Their Codes[M]. Cambridge: Cambridge University Press, 1992:37-43.
6MaeWilliams F J. Permutation decoding of systematic eodes[J]. Bell System Tech J, 1964, 43 (2):485-505.
7MacWilliams F J, Sloane N J A. The Theory of Error-correcting Codes[M]. Amsterdam: North-Holland, 1998: 1227-1231.
8Huffman W C. Codes and groups[M]//Ptess V S, Huffman W C. Handbook of Coding Theory. Amsterdam: Elsevier, 1988:1345-1440.
9Gordon D M. Minimal permutation sets for decoding the binary Golay codes[J]. IEEE Trans Inform Theory, 1982, 28 (2) : 541-543.
10Schonheim J. On coverings[J]. Pacific J Math, 1964, 14 (4) : 1405-1411.

1杜客君.二次根式常见错误诊断[J].数学大世界（初中版）,2014(9):18-20.
2黄干平,郑晖,李世平.多处理机系统上不相容作业集的分配问题[J].武汉大学学报（自然科学版）,2000,46(3):277-279.
3游兆永,陈明逵,曹林.多处理机系统上求解非线性方程组的异步并行拟牛顿法[J].计算机工程与科学,1991,13(3):8-16.
4张明祖,孟吉翔,田应智.超立方体外边连通度可靠性分析(英文)[J].新疆大学学报（自然科学版）,2013,30(3):253-256. 被引量：2
5梁吉业,周文峰,乔金虎.非线性方程组异步迭代法的收敛性[J].山西大学学报（自然科学版）,1998,21(1):23-26.
6于亦凡,常慧.利用滑模观测器实现基于模型的错误诊断[J].青岛大学学报（自然科学版）,2002,15(2):62-64.
7王霞,陈鹏,赵玲玲.超立方多处理机上大型线性方程组并行迭代求解算法[J].郑州工业大学学报,1998,19(3):86-89. 被引量：1
8于广亮,穆钢,夏庆生.运用Normal Form变换确定故障临界切除时间的有效性分析[J].东北电力学院学报,2004,24(4):1-5.
9王玉洁,原军,刘秀丽,高晓慧.BC网络的限制边连通度[J].太原科技大学学报,2015,36(6):480-485.
10卢丽珊,周书明.加强立方网络的条件诊断度[J].福建师范大学学报（自然科学版）,2014,30(1):33-38.

郑州大学学报（理学版）

2013年第4期

浏览历史

内容加载中请稍等...

图cy_nk_2中r-ID码和r-LD码的界

参考文献8

二级参考文献11

相关作者

相关机构

相关主题

浏览历史