首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4篇
  免费   0篇
  国内免费   1篇
数学   5篇
  2012年   1篇
  2011年   1篇
  2007年   2篇
  2004年   1篇
排序方式: 共有5条查询结果,搜索用时 15 毫秒
1
1.
Let G be the finite cyclic group Z_2 and V be a vector space of dimension 2n with basis x_1,...,x_n,y_1,...,y_n over the field F with characteristic 2.If σ denotes a generator of G,we may assume that σ(x_i)= ayi,σ(y_i)= a~-1x_i,where a ∈ F.In this paper,we describe the explicit generator of the ring of modular vector invariants of F[V]~G.We prove that F[V]~G = F[l_i = x_i + ay_i,q_i = x_iy_i,1 ≤ i ≤ n,M_I = X_I + a~-I-Y_I],where I∈An = {1,2,...,n},2 ≤-I-≤ n.  相似文献   
2.
设G 为有限域K 上的一般线性群(特殊线性群、酉群、辛群及正交群), 记整群环ZG 的n 次增广理想为△n(G). 本文着重研究有限域上的典型群的增广商群Qn(G) = △n(G)/△n+1(G), 并刻画了这些连续商群的结构.  相似文献   
3.
In this paper,we determine the normal forms of idempotent matrices for similarity over finite local rings Z/p~kZ,from which we construct a Cartesian au- thentication code and compute its size parameters and the probabilities of successful impersonation and substitution attack under the hypothesis that the cecoding rules are chosen according to a uniform probability distribution.  相似文献   
4.
赵辉芳  南基洙 《东北数学》2007,23(2):123-131
In this paper, we determine the normal forms of idempotent matrices for similarity over finite local rings Z/p^kZ, from which we construct a Cartesian authentication code and compute its size parameters and the probabilities of successful impersonation and substitution attack under the hypothesis that the cecoding rules are chosen according to a uniform probability distribution.  相似文献   
5.
利用有限域上一类幂零阵的标准形构造Cartesian认证码   总被引:1,自引:0,他引:1  
赵辉芳  秦德生 《东北数学》2004,20(4):415-423
Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities PI and PS, of a successful im-personation attack and of a successful substitution attack respectively, of these codes are also computed.  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号