Skip to main content

Pseudo-Random Sequences with a Priori Distribution

  • Chapter
  • 94 Accesses

Part of the book series: International Centre for Mechanical Sciences ((CISM,volume 279))

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. de Bruijn, N. G., A combinatorial problem, Pros. Neder. Akad. Wetensch, 49, 1946.

    Google Scholar 

  2. Fredricksen, H., A survey of full length nonlinear shift register cycle algorithms, SIAM Review, 24, 195, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  3. von Aardenne-Ehrenfest, T. and de Bruijn, N.G., Circuits and trees in ordered linear graphs, Simon Steven, 28, 203, 1951.

    MATH  Google Scholar 

  4. 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.

    Google Scholar 

  5. Golomb, S. W., Shift Register Sequences, Aegean Park Press, Laguna Hills, 1982.

    Google Scholar 

  6. Berge, C., Graphs and Hypergraphs, North-Holland, Amsterdam-London, 1973.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics