| 图Kn—E（kPs∪rK3）的色唯一性 |
| |
| 引用本文： | 张秀英. 图Kn—E（kPs∪rK3）的色唯一性[J]. 东北师大学报(自然科学版), 1997, 0(2): 8-14 |
| |
| 作者姓名： | 张秀英 |
| |
| 作者单位： | 东北师范大学数学系 |
| |
| 摘 要： | 利用不可约路的概念，证明了当Ｐｓ是不可约的路时，Ｋｎ－Ｅ（ｋＰｓ∪ｒＫ３）是色唯一的图，其中设Ｋｎ－Ｅ（Ｇ）表示从完全图Ｋｎ中删去一个和Ｇ同构的子图的所有边而得到的图，ｓ≠４，且ｋｓ＋３ｒ＝ｎ，ｋ３是有３个顶点的完全图，同时给出了三类新的色等价图簇。
|
| 关 键 词： | 伴随多项式 色唯一性 不可约路 连通图 简单图 |
Using Involutory Matrices over Finite Fields to Construct Cartesian Authentication Codes |
| |
| Li Li. Using Involutory Matrices over Finite Fields to Construct Cartesian Authentication Codes[J]. Journal of Northeast Normal University (Natural Science Edition), 1997, 0(2): 8-14 |
| |
| Authors: | Li Li |
| |
| Abstract: | In this paper,one construction of Cartesian authentication codes from involutory matrices over finite field are presented and its size parameters are computed.Moreover,assume that the encoding rules are chosen according to uniform probability distribution,the P I and P S,which denote the largest probalities of a successful impresonation attack and a successful substitution attack respectively,of these codes are alse computed. |
| |
| Keywords: | finite field involutory matrix authentication code source encoding rule messge. |
| 本文献已被 CNKI 维普 等数据库收录！ |
