Muutke küpsiste eelistusi

E-raamat: Shift Register Sequences: Secure And Limited-access Code Generators, Efficiency Code Generators, Prescribed Property Generators, Mathematical Models (Third Revised Edition)

(Univ Of Southern California, Usa)
  • Formaat: 272 pages
  • Ilmumisaeg: 25-Jan-2017
  • Kirjastus: World Scientific Publishing Co Pte Ltd
  • Keel: eng
  • ISBN-13: 9789814632027
  • Formaat - EPUB+DRM
  • Hind: 91,26 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: 272 pages
  • Ilmumisaeg: 25-Jan-2017
  • Kirjastus: World Scientific Publishing Co Pte Ltd
  • Keel: eng
  • ISBN-13: 9789814632027

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

Shift register sequences cover a broad range of applications, from radar signal design, pseudo-random number generation, digital wireless telephony, and many other areas in coded communications. It is the primary area for which the author, Dr Golomb, received the US National Medal of Science. This book is the third, revised edition of the original definitive book on shift register sequences which was published in 1967, which has been widely distributed, read, and cited. It has stood the test of time, and provides a clear, comprehensive, and readily applicable description of both linear and non-linear shift register sequences.
Introduction to Solomon W. Golomb vii
E. Berlekamp
Preface xi
Preface to the Revised Edition xv
Preface to the Third Edition xvii
Acknowledgments xix
PART I PERSPECTIVE
1(22)
Chapter I The Present Status of the Shift Register Art
2(5)
1 Introduction
2(1)
2 Areas of Application
2(2)
3 Advantages of Shift Registers
4(3)
Chapter II The Shift Register as a Finite State Machine
7(16)
1 Finite State Machines
7(5)
2 Shift Registers
12(7)
3 Generalized Shift Registers
19(4)
PART II THE LINEAR THEORY
23(86)
Chapter III Sequences With Randomness Properties
24(51)
1 Introduction
24(3)
2 Shift Register Sequences
27(10)
3 Polynomials Modulo 2
37(6)
4 Randomness Properties of Shift Register Sequences
43(5)
5 Cyclotomic Polynomials
48(11)
6 Computational Techniques
59(16)
Chapter IV Structural Properties of PN Sequences
75(15)
1 Introduction
75(1)
2 Multipliers of PN Sequences
76(1)
3 The Cyclotomic Cosets
77(1)
4 Decimation of Sequences
78(1)
5 The Superposition of Cosets
79(3)
6 Regularities in the Cross-Correlation of PN Sequences
82(3)
7 The Fourier Analysis of PN Sequences
85(3)
8 Perfect Sequences
88(2)
Chapter V On the Factorization of Trinomials Over GF(2)
90(19)
1 Introduction
90(1)
2 Theoretical Discussion
90(1)
3 Procedure
91(1)
4 Compendium of Special Results
92(4)
5 Unsolved Problems
96(13)
PART III THE NONLINEAR THEORY
109(120)
Chapter VI Nonlinear Shift Register Sequences
110(59)
1 Introduction
110(1)
2 Mathematical Treatment
111(30)
3 Experimental Results
141(6)
4 Tabulation of Experimental Data
147(22)
Chapter VII Cycles from Nonlinear Shift Registers
169(43)
1 Introduction
169(1)
2 The Deterministic Approach
169(6)
3 The Statistical Approach
175(14)
4 Alternative Approaches to the Distribution of the Longest Cycle
189(3)
5 Shift Register Cycles of All Lengths
192(2)
6 The Experimental Approach
194(2)
7 Tables of Complete Decompositions Into Cycles
196(16)
Chapter VIII On the Classification of Boolean Functions
212(13)
1 Introduction
212(1)
2 The Zero- and First-Order Invariants
213(2)
3 The Higher-Order Invariants
215(1)
4 Canonical Forms
216(1)
5 The Rademacher-Walsh Expansion Coefficients
217(2)
6 Practical Methods of Computing the Invariants
219(2)
7 Application to Finding Asymmetrical Logical Functions
221(1)
8 Related Results and Problems
221(4)
References
Chapters I-VIII
223(2)
Chapter IX Selective Update
225(4)
References
Chapter IX
229(4)
Comprehensive Bibliography 233