Number theory in science and communication. With applications in cryptography, physics, digital information, computing, and self- similarity.
zbMATH Open0613.10001MaRDI QIDQ1801286FDOQ1801286
Authors: Manfred R. Schroeder 
Publication date: 5 June 1993
Published in: Springer Series in Information Sciences (Search for Journal in Brave)
random number generationradarsonarself-similaritycryptographyfractalserror correcting codeserror-free computationartistic designcomputer speech synthesispublic-key fast algorithms
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algebraic numbers; rings of algebraic integers (11R04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Arithmetic theory of polynomial rings over finite fields (11T55) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Primes (11A41) Cyclotomy (11T22) Elementary number theory (11Axx) Diophantine equations (11Dxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to field theory (12-01)
Cited In (23)
- Divisibility and cellular automata
- Spectral analysis of phylogenetic data
- Robust identification and Galois sequences
- Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
- Periodic point processes: theory and application
- Self-imaging and discrete paraxial optics
- Neural cryptography with queries
- The least squares algorithm, parametric system identification and bounded noise
- The least-squares identification of FIR systems subject to worst-case noise
- Event and apparent horizon finders for \(3+1\) numerical relativity
- Srinivasa Ramanujan (1887‐1920) A centennial tribute
- The analysis of eigenstates of a few generalized quantum baker's maps using Hadamard and related transforms
- On characterization of the onset to chaos
- Partitions, Egyptian Fractions, and Free Products of Finite Abelian Groups
- A study on the statistical properties of the prime numbers using the classical and superstatistical random matrix theories
- Divisibility properties of random samples of integers
- Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme
- Möbius inversion formulas for flows of arithmetic semigroups
- A universal departure from the classical period doubling spectrum
- An efficient algorithm for deciding quadratic residuosity in finite fields \(GF(p^ m)\)
- A cellular automaton ruled by an eccentric conservation law
- Number theory in science and communication. With applications in cryptography, physics, digital information, computing, and self-similarity.
- Continued fraction solution of the Riccati equation: Application to acoustic horns and layered inhomogeneous media, with equivalent electrical circuits
This page was built for publication: Number theory in science and communication. With applications in cryptography, physics, digital information, computing, and self- similarity.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801286)
