GENERATION OF MAXIMAL LENGTH SEQUENCES WITHOUT MODULO 2 ADDERS

被引:0
作者
BONDY, T
机构
来源
ACTA TECHNICA ACADEMIAE SCIENTIARUM HUNGARICAE | 1971年 / 70卷 / 3-4期
关键词
D O I
暂无
中图分类号
P3 [地球物理学]; P59 [地球化学];
学科分类号
0708 ; 070902 ;
摘要
引用
收藏
页码:371 / &
相关论文
共 50 条
  • [31] MAXIMAL IDEALS IN NEAR RING OF POLYNOMIALS MODULO 2
    BRENNER, JL
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (02): : A249 - A249
  • [32] Efficient Weighted Modulo 2n+1 Adders by Partitioned Parallel-Prefix Computation and Enhanced Circular Carry Generation
    Juang, Tso-Bing
    Meher, Pramod Kumar
    Chiu, Chin-Chieh
    2011 INTERNATIONAL SYMPOSIUM ON VLSI DESIGN, AUTOMATION AND TEST (VLSI-DAT), 2011, : 402 - 405
  • [33] A Family of Area-Time Efficient Modulo 2n+1 Adders
    Vergos, H. T.
    IEEE ANNUAL SYMPOSIUM ON VLSI (ISVLSI 2010), 2010, : 442 - 443
  • [34] On the correlation distribution of the generalized maximal length ℤ4-sequences
    Lisha Wang
    Xiaohu Tang
    Cryptography and Communications, 2017, 9 : 199 - 215
  • [35] MAXIMAL LENGTH OF COMMON WORDS AMONG RANDOM LETTER SEQUENCES
    KARLIN, S
    OST, F
    ANNALS OF PROBABILITY, 1988, 16 (02) : 535 - 563
  • [36] Prediction of maximal length pseudorandom sequences using neural networks
    Neugebauer, Shawn P.
    Reed, Jeffrey H.
    Artificial Neural Networks in Engineering - Proceedings (ANNIE'94), 1994, 4 : 675 - 680
  • [38] Periods of termwise exclusive ors of maximal length FCSR sequences
    Tian, Tian
    Qi, Wen-Feng
    FINITE FIELDS AND THEIR APPLICATIONS, 2009, 15 (02) : 214 - 235
  • [39] Double {0,1,2} Representation Modulo-(2n-3) Adders
    Fatemi, Hamed
    Jaberipur, Ghassem
    21ST INTERNATIONAL CONFERENCE ON SYSTEMS, SIGNALS AND IMAGE PROCESSING (IWSSIP 2014), 2014, : 119 - 122
  • [40] Handling zero in diminished-one modulo 2n+1 adders
    Efstathiou, C
    Vergos, HT
    Nikolos, D
    INTERNATIONAL JOURNAL OF ELECTRONICS, 2003, 90 (02) : 133 - 144