Cantitate/Preț
Produs
Total produse
Vezi coșul
Communications and Cryptography: Two Sides of One Tapestry de Richard E. Blahut

Communications and Cryptography: Two Sides of One Tapestry: The Springer International Series in Engineering and Computer Science, cartea 276

Editat de Richard E. Blahut, Daniel J. Costello Jr., Ueli Maurer, Thomas Mittelholzer
en Limba Engleză Paperback – 12 oct 2012
Information theory is an exceptional field in many ways. Technically, it is one of the rare fields in which mathematical results and insights have led directly to significant engineering payoffs. Professionally, it is a field that has sustained a remarkable degree of community, collegiality and high standards. James L. Massey, whose work in the field is honored here, embodies the highest standards of the profession in his own career.
The book covers the latest work on: block coding, convolutional coding, cryptography, and information theory. The 44 contributions represent a cross-section of the world's leading scholars, scientists and researchers in information theory and communication. The book is rounded off with an index and a bibliography of publications by James Massey.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 116532 lei  6-8 săpt.
  Springer Us – 12 oct 2012 116532 lei  6-8 săpt.
Hardback (1) 117764 lei  6-8 săpt.
  Springer Us – 30 iun 1994 117764 lei  6-8 săpt.

Din seria The Springer International Series in Engineering and Computer Science

Preț: 116532 lei

Preț vechi: 142112 lei
-18% Nou

Puncte Express: 1748
Preț estimativ în valută:
22305€ • 23985$ • 18590£

Carte tipărită la comandă

Livrare economică 20 decembrie 24 - 03 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781461361596
ISBN-10: 1461361591
Pagini: 504
Ilustrații: XVII, 481 p.
Dimensiuni: 178 x 254 x 26 mm
Greutate: 0.87 kg
Ediția:Softcover reprint of the original 1st ed. 1994
Editura: Springer Us
Colecția Springer
Seria The Springer International Series in Engineering and Computer Science

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

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.