Coding, Cryptography and Combinatorics: Progress in Computer Science and Applied Logic, cartea 23
Editat de Keqin Feng, Harald Niederreiter, Chaoping Xingen Limba Engleză Paperback – 21 noi 2012
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 633.36 lei 43-57 zile | |
Birkhäuser Basel – 21 noi 2012 | 633.36 lei 43-57 zile | |
Hardback (1) | 639.63 lei 43-57 zile | |
Birkhäuser Basel – 25 iun 2004 | 639.63 lei 43-57 zile |
Din seria Progress in Computer Science and Applied Logic
- 20% Preț: 335.90 lei
- Preț: 372.60 lei
- 20% Preț: 326.84 lei
- 20% Preț: 999.65 lei
- 15% Preț: 579.34 lei
- 20% Preț: 333.65 lei
- 20% Preț: 611.79 lei
- 20% Preț: 327.98 lei
- 20% Preț: 642.59 lei
- Preț: 379.96 lei
- 15% Preț: 576.15 lei
- 20% Preț: 574.85 lei
- 20% Preț: 465.28 lei
- Preț: 402.62 lei
- Preț: 385.81 lei
- Preț: 395.64 lei
- 15% Preț: 633.70 lei
- 20% Preț: 635.90 lei
- 20% Preț: 332.83 lei
- 15% Preț: 684.81 lei
- 15% Preț: 641.20 lei
- 18% Preț: 716.01 lei
- Preț: 391.27 lei
- 20% Preț: 420.91 lei
- 20% Preț: 328.29 lei
- Preț: 372.24 lei
- Preț: 373.35 lei
- 20% Preț: 328.13 lei
Preț: 633.36 lei
Preț vechi: 745.13 lei
-15% Nou
Puncte Express: 950
Preț estimativ în valută:
121.21€ • 125.91$ • 100.68£
121.21€ • 125.91$ • 100.68£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783034896023
ISBN-10: 3034896026
Pagini: 420
Ilustrații: VIII, 405 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:Softcover reprint of the original 1st ed. 2004
Editura: Birkhäuser Basel
Colecția Birkhäuser
Seria Progress in Computer Science and Applied Logic
Locul publicării:Basel, Switzerland
ISBN-10: 3034896026
Pagini: 420
Ilustrații: VIII, 405 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:Softcover reprint of the original 1st ed. 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