期刊文献+

一类同余多模编码序列分析与实现

Analysis and the Realization of the Code Sequence for Multi-modulus Congruence
下载PDF
导出
摘要 为了研究新的编码与密码系统的需要,引入一种新的同余多模编码序列概念,分析了这种序列的基本模型和相关性质.给出了一组新的第二类同余多模编码序列具体构造和证明过程,并讨论了在变模条件下相关同余特征和密码应用的基本思路. To study the necessity of new cod ing and cipher system, this paper has inducted the concep- tion of code sequence for new multi-modulus congruence. The basic model of this multi-modulus congruence and its correlation properties are analyzed. The construction and the proving process of a group of new second- class code sequence for multi-modulus congruence are given, and basicidea about correlation congruence properties and the cipher application is discussed.
出处 《集美大学学报(自然科学版)》 CAS 2005年第2期97-101,共5页 Journal of Jimei University:Natural Science
基金 国家自然科学基金项目(60172017) 福建省自然科学基金项目(A0210012) 福建省教育厅科技计划项目(JB03022)
关键词 同余多模编码序列 同余特征 通项公式 相关性质 密码应用 <Keyword>code sequence of multi-modulus congruence congruence trait formula of general term interrelated properties cipher application
  • 相关文献

参考文献12

  • 1Etzion T. An Algorithm for constructing m-ary de Brul jn sequence [J]. J Algorithms, 1986, 7(2) : 331-340.
  • 2Luke H D. Binary odd-periodic complementary sequences [J]. IEEE Trans Inform Theory, 1997, 43 (1) : 365-367.
  • 3Lin D, Liu hi. Structure and properties of LR m-Arrays [J].IEEE on IT, 1993, 39 (5) : 1758-1762.
  • 4Pellikaan R, Xin-Wen Wu. List decoding of q-ary Reed-Muller codes [J]. IEEE. Tram Inform Theory, 2004, 50: 679-6822.
  • 5Bender P E, Wolf J K.A universal algorithm for generating optimal and nearly optimal run-length-limited, charge constrained binary sequences [ EB/OL]. http ://ieexplore. ieee. org/xpl/tocresult. jsp? isnumber = 14996, 2002-08-06.
  • 6Stamp M, Martin F.An algorithm for the k-error linear complexity of binary sequences with period 2 [J].IEEE Thans Inform Theory, 1993, 39: 1398-1401.
  • 7Rueppel R A.Linear complexity and random sequences [M].Berlin: Springer-Vedag, 1985. 167-188.
  • 8Cover T M.Behavior of sequential predictors of binary sequences [EB/OL].http: //www.stanford.edu/class/ee477/reference.shtml, 2004-09-10.
  • 9Meron E, Feder M. Finite - memory universal prediction of individual sequences [J].IEEE Trans Inform Theory, 2004,50. 1506-1523.
  • 10Rajwan D, Feder M.Universal finite memory machines for coding binary sequences [EB/OL].http ://www. computer.org/cspress/CATALOG/proc692.htm, 2004-09-10.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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