Abstract
This paper introduces a hypergraph-theoretic technique for the synthesis of sequences with prescribed distributions. A positive n-distribution is an assignment of a positive integer to each n-letter word with letters chosen from some fixed finite alphabet. A distribution is atomic if it always assigns the same integer to words that are cyclic shifts of each other. A periodic sequence of letters from the alphabet is said to realize a given distribution if the distribution assigns to each word its frequency of occurrence in a single period of the sequence. Given a positive atomic redistribution, we construct a hypergraph, the subgraphs of which correspond to a family of modified nonlinear feedback shift registers. Each shift register in a family corresponding to a spanning hypertree of the hypergraph will generate a sequence realizing the given distribution.
This research was accomplished as part of the MITRE Corporation’s Independent Research and Development Program.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
de Bruijn, N. G., A combinatorial problem, Pros. Neder. Akad. Wetensch, 49, 1946.
Fredricksen, H., A survey of full length nonlinear shift register cycle algorithms, SIAM Review, 24, 195, 1982.
von Aardenne-Ehrenfest, T. and de Bruijn, N.G., Circuits and trees in ordered linear graphs, Simon Steven, 28, 203, 1951.
Rabinowitz, J. H., de Bruijn sequences and hypergraphs over finite alphabets, Proceedings of the Thirteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium,Utilitas Math., Winnipeg, to appear.
Golomb, S. W., Shift Register Sequences, Aegean Park Press, Laguna Hills, 1982.
Berge, C., Graphs and Hypergraphs, North-Holland, Amsterdam-London, 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Wien
About this chapter
Cite this chapter
Rabinowitz, J.H. (1983). Pseudo-Random Sequences with a Priori Distribution. In: Longo, G. (eds) Secure Digital Communications. International Centre for Mechanical Sciences, vol 279. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2640-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2640-0_12
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81784-1
Online ISBN: 978-3-7091-2640-0
eBook Packages: Springer Book Archive