Pseudonoise sequences based on algebraic feedback shift registers

Authors:
M. Goresky;A. Klapper
Affiliations:
Sch. of Math., Inst. for Adv. Study, Princeton, NJ, USA;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 5

Investigating some special sequence lengths generated in an external exclusive-NOR type LFSR

Computers and Electrical Engineering
Some Results on the Arithmetic Correlation of Sequences

SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Maximal-Period Sequences Generated by Feedback-Limited Nonlinear Shift Registers

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Ambiguity of unary symmetric difference NFAs

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Designing stream cipher systems using genetic programming

LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization

Quantified Score

Hi-index	754.84

Visualization

Abstract

Over the past half century, various statistical properties of pseudorandom sequences have played important roles in a variety of applications. Among these properties are Golomb's randomness conditions: (R1) balance, (R2) run property, and (R3) ideal autocorrelations, as well as the closely related properties (R4) shift and add, and (R5) de Bruin (uniform distribution of subblocks). The purpose of this paper is to describe the relationships among these conditions, and to introduce a new method for generating sequences with all these properties, using algebraic feedback shift registers.