• Produktbild: Communications and Cryptography
  • Produktbild: Communications and Cryptography
Band 276

Communications and Cryptography Two Sides of One Tapestry

Fr. 238.00

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

12.10.2012

Abbildungen

XVII, 481 p.

Herausgeber

Richard E. Blahut + weitere

Verlag

Springer Us

Seitenzahl

481

Maße (L/B/H)

25.4/17.8/2.8 cm

Gewicht

938 g

Auflage

Softcover reprint of the original 1st ed. 1994

Sprache

Englisch

ISBN

978-1-4613-6159-6

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

12.10.2012

Abbildungen

XVII, 481 p.

Herausgeber

Verlag

Springer Us

Seitenzahl

481

Maße (L/B/H)

25.4/17.8/2.8 cm

Gewicht

938 g

Auflage

Softcover reprint of the original 1st ed. 1994

Sprache

Englisch

ISBN

978-1-4613-6159-6

Herstelleradresse

Libri GmbH
Europaallee 1
36244 Bad Hersfeld
DE

Email: gpsr@libri.de

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Communications and Cryptography
  • Produktbild: Communications and Cryptography
  • 1 Development of Fast Multiplier Structures with Cryptographic Applications.- 2 Messy Broadcasting in Networks.- 3 On a Problem of Persi Diaconis.- 4 Aspects of Linear Complexity.- 5 Massey’s Theorem and the Golay Codes.- 6 Coding for Adder Channels.- 7 Using Redundancy to Speed up Disk Arrays.- 8 Progress Towards Achieving Channel Capacity.- 9 Random Time and Frequency Hopping for Infinite User Population.- 10 On Repeated-Single-Root Constacyclic Codes.- 11 Orthogonal Checksets in the Plane and Enumerations of the Rationals mod p.- 12 Spherical Codes from the Hexagonal Lattice.- 13 Trellises Old and New.- 14 An Inequality on the Capacity Region of Multiaccess Multipath Channels.- 15 A Finite Field Fourier Transform for Vectors of Arbitrary Length.- 16 Soft is Better than Hard.- 17 Charge Constrained Convolutional Codes.- 18 Delay Estimation for Truly Random Binary Sequences or How to Measure the Length of Rip van Winkle’s Sleep.- 19 On Canonical Encoding Matrices and the Generalized Constraint Lengths of Convolutional Codes.- 20 A Comparison of Error Patterns Corrected by Block Codes and Convolutional Codes.- 21 Encounters with the Berlekamp-Massey Algorithm.- 22 Using Zech’s Logarithm to Find Low-Weight Parity Checks for Linear Recurring Sequences.- 23 Higher Order Derivatives and Differential Cryptanalysis.- 24 Coded MPSK Modulation for the AWGN and Rayleigh Fading Channels.- 25 On the Basic Averaging Arguments for Linear Codes.- 26 Coding and Multiplexing.- 27 The Strong Secret Key Rate of Discrete Random Triples.- 28 The Self-Shrinking Generator.- 29 Constructions and Decoding of Optimal Group Codes from Finite Reflection Groups.- 30 Duality of Linear Input-Output Maps.- 31 Cut-Off Rate Channel Design.- 32 Construction of Invertible Sequences for MultipathEstimation.- 33 Five Views of Differential MSK: A Unified Approach.- 34 Leaf-Average Node-Sum Interchanges in Rooted Trees with Applications.- 35 On the Performance of Aperiodic Inverse Filter Approximations.- 36 Inverses of Linear Sequential Circuits: On Beyond Poles and Zeros.- 37 Binary Sequences with Small Correlations.- 38 Fast Bounded-Distance Decoding of the Nordstrom-Robinson Code.- 39 Binary Convolutional Codes Revisited.- 40 Some Reflections on the Interference Channel.- 41 Capacity of a Simple Stable Protocol for Short Message Service over a CDMA Network.- 42 The Sliding-Window Lempel-Ziv Algorithm is Asymptotically Optimal.- 43 On Code Linearity and Rotational Invariance for a Class of Trellis Codes for M-PSK.- 44 Algebraic-Sequential Decoding - Ideas and Results.- Publications by James Massey.