期刊文献+

取值于有限域上的独立随机变量和的极限分布定理 被引量:2

Limit Distribution Theorem for a Sum of Independent Random Variables Whose Values Belong to a Finite Field
下载PDF
导出
摘要 利用文献[1]中所定义的取值于有限域上随机变量的特征函数,首先得到了在一定条件下取值于有限域上的独立随机变量和的极限分布为均匀分布的充分必要条件,再利用无穷乘积的有关性质,又给出了取值于有限域上的独立随机变量和的极限分布为均匀分布的若干充分条件,特别地,当独立随机变量取值于素域时,所得的充分条件更易于验证且不难满足.从所得结论看,取值于有限域上独立随机变量和的极限分布收敛于均匀分布的条件并不难满足,这与相互独立的实值随机变量和的分布在许多情况下收敛于正态分布是类似的. With the characteristic function defined in document ,this paper gives a sufficient and necessary condition for the distribution of a sum of independent random variables whose values belong to a finite field to converge to uniform distribution .In addition,we have given the sufficient conditions that the limit distribution of a sum of independent random variables whose values belong to a finite field is uniform. Particularly,when the independent ramdon variables' values belong to a prime field,the sufficient condition is easy to be satified.It isn't difficult to satisfy these conditions.Therefore,it is easy for the distribution of a sum of independent random variables whose values belong to a finite field to converge to uniform distribution.which is similar to that the asymptotic distribution of a sum of independent real valued random variables is usually normal.
出处 《河北工业大学学报》 CAS 1999年第1期98-102,共5页 Journal of Hebei University of Technology
关键词 随机变量 特征函数 均匀分布 极限分布定理 Finite field,Random variable,Characteristic function,Uniform distribution
  • 相关文献

参考文献4

共引文献5

同被引文献12

  • 1AHLSWEDE R, CAI N, LI S. Network information flow[J]. IEEE Transactions on Information Flow, 2000, 46(4):1204-1216.
  • 2PERVAIZ M, CARDEI M, WU J. Routing security in ad hoc wireless networks[J]. Network Security, 2010, 117-142.
  • 3HO T, LEONG B, KOETTER R. Byzantine modification detection in multicast networks using randomized network coding[A]. Proceedings of IEEE International Symposium on Information Theory(ISIT)[C]. Massachusetts, USA, 2008. 2798-2803.
  • 4GKANTSIDIS C, RODRIGUEZ E Cooperative security for network coding file distribution[A]. Proceedings of International Conference on Computer 367-380. [M)[C]. Barcelona, Spain, 2006.
  • 5MENEZES A, OKAMOTO T, VANSTONE S. Reducing elliptic curve logorithms to logorithms in a finite field[J]. IEEE Transactions on Information Theory, 1993, 39(5):1639-1646.
  • 6YU Z, WEI Y, RAMKUMAR B. An efficient signature-based scheme for secttdng network coding against pollution attacks[A]. Proceedings of International Conference on Computer Communications (INFOCOM)[C]. Arizona, USA, 2008. 1409-1417.
  • 7GENNARO R, KATZ J, KRAWCZYK H. Secure network coding over the integers[J]. Public Key Cryptography, 2010, 60(56):142-160.
  • 8LIM S H, KIM Y H. Noisy network coding[J]. IEEE Transactions on Information Theory, 2011, 57(5):3132-3152.
  • 9LIM S H, GERLA M, KRAWCZYK H. Performance evaluation of secure network coding using homomorphic signature[A]. Proceedings of International Symposium on Network Coding(NetCod)[C]. Beijing, China, 2011.1-6.
  • 10SUTAR S G, PATIL G A. Privacy management in cloud by making use of homomorphic functions[J]. International Journal of Computer Applications, 2012, 37(2):13-16.

引证文献2

二级引证文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部