Coding, Cryptography and Combinatorics: Progress in Computer Science and Applied Logic, cartea 23
Editat de Keqin Feng, Harald Niederreiter, Chaoping Xingen Limba Engleză Hardback – 25 iun 2004
Din seria Progress in Computer Science and Applied Logic
- 20%
Preț: 329.74 lei -
Preț: 368.16 lei - 20%
Preț: 319.28 lei - 24%
Preț: 904.96 lei - 15%
Preț: 568.52 lei - 20%
Preț: 327.48 lei - 20%
Preț: 661.59 lei - 20%
Preț: 321.98 lei - 20%
Preț: 624.19 lei -
Preț: 373.03 lei - 20%
Preț: 564.08 lei - 20%
Preț: 456.63 lei -
Preț: 395.25 lei -
Preț: 378.78 lei -
Preț: 388.43 lei - 15%
Preț: 621.80 lei - 15%
Preț: 621.48 lei - 20%
Preț: 325.72 lei - 15%
Preț: 668.55 lei - 15%
Preț: 626.11 lei - 18%
Preț: 701.91 lei -
Preț: 384.13 lei - 20%
Preț: 485.40 lei - 20%
Preț: 321.97 lei -
Preț: 367.68 lei -
Preț: 368.53 lei - 20%
Preț: 321.74 lei
Preț: 627.62 lei
Preț vechi: 738.37 lei
-15%
Puncte Express: 941
Carte tipărită la comandă
Livrare economică 16-30 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783764324292
ISBN-10: 3764324295
Pagini: 420
Ilustrații: VIII, 405 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.76 kg
Ediția:2004
Editura: Birkhäuser Basel
Colecția Birkhäuser
Seria Progress in Computer Science and Applied Logic
Locul publicării:Basel, Switzerland
ISBN-10: 3764324295
Pagini: 420
Ilustrații: VIII, 405 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.76 kg
Ediția:2004
Editura: Birkhäuser Basel
Colecția Birkhäuser
Seria Progress in Computer Science and Applied Logic
Locul publicării:Basel, Switzerland
Public țintă
ResearchCuprins
On the Secondary Constructions of Resilient and Bent Functions.- Adaptive Recursive MLD Algorithm Based on Parallel Concatenation Decomposition for Binary Linear Codes.- Modularity of Asymptotically Optimal Towers of Function Fields.- A New Correlation Attack on LFSR Sequences with High Error Tolerance.- LDPC Codes: An Introduction.- The New Implementation Schemes of the TTM Cryptosystem Are Not Secure.- The Capacity Region of Broadcast Networks with Two Receivers.- Constructions of Nonbinary Codes Correcting t- Symmetric Errors and Detecting All Unidirectional Errors: Magnitude Error Criterion.- On the Propagation Criterion of Boolean Functions.- On Certain Equations over Finite Fields and Cross-Correlations of m-Sequences.- A Polly Cracker System Based on Satisfiability.- Combinatorially Designed LDPC Codes Using Zech Logarithms and Congruential Sequences.- New Constructions of Constant-Weight Codes.- Good Self-Dual Quasi-Cyclic Codes over Fq, q Odd.- Linear Complexity and k-Error Linear Complexity for pn-Periodic Sequences.- HFE and BDDs: A Practical Attempt at Cryptanalysis.- Digital Nets and Coding Theory.- Constructive Asymptotic Codes with an Improvement on the Tsfasman-Vlá,dut-Zink and Xing Bounds.- Malleability Attacks on Multi-Party Key Agreement Protocols.- Combinatorial Tableaux in Isoperimetry.- On the Error Exponents of Reliability-Order-Based Decoding Algorithms for Linear Block Codes.- A Construction of Authentication Codes with Secrecy.- Selection Method of Test Patterns in Soft-Input and Output Iterative Bounded Distance Decoding Algorithm.- Deletion Correcting Using Generalised Reed-Solomon Codes.- A Note on the Linear Complexity Profile of the Discrete Logarithm in Finite Fields.- Speeding Up RSA and Elliptic Curve Systems by Choosing SuitableModuli.- Security Analysis of Three Oblivious Transfer Protocols.- An Improved Identification Scheme.
Caracteristici
Unique collection of contributions at the frontier between mathematics and computer science