Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	November 2007
Genre:	EDV / Informatik
	Algorithm Analysis and Problem Complexity / Algorithms / Algorithms & data structures / C / Coding and Information Theory / Coding theory / Coding theory & cryptology / computer science / Computer science—Mathematics / Cryptology / Data encryption / Data encryption (Computer science) / Data structures (Computer science) / Data Structures and Information Theory / Discrete Mathematics / Discrete Mathematics in Computer Science / Diskrete Mathematik / Information theory / Informationstheorie / Kodierungstheorie und Verschlüsselung (Kryptologie) / Kryptografie, Verschlüsselungstechnologie / Mathematik für Informatiker / Maths for computer scientists / Symbolic and Algebraic Manipulation mehr...
ISBN:	9783540772231
EAN-Code:	9783540772231
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#4851 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	593 gr
Seiten:	368
Illustration:	XII, 368 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Invited Contributions.- List Decoding and Pseudorandom Constructions.- A Survey of Recent Attacks on the Filter Generator.- Iterative List Decoding of LDPC Codes.- Inverted Edwards Coordinates.- Spectra of Boolean Functions, Subspaces of Matrices, and Going Up Versus Going Down.- Efficient List Decoding of Explicit Codes with Optimal Redundancy.- Algebraic Structure Theory of Tail-Biting Trellises.- Nice Codes from Nice Curves.- Regular Contributions.- Generalized Sudan's List Decoding for Order Domain Codes.- Bent Functions and Codes with Low Peak-to-Average Power Ratio for Multi-Code CDMA.- Determining the Nonlinearity of a New Family of APN Functions.- An Improvement of Tardos's Collusion-Secure Fingerprinting Codes with Very Short Lengths.- Space-Time Codes from Crossed Product Algebras of Degree 4.- On Non-randomness of the Permutation After RC4 Key Scheduling.- Correctable Errors of Weight Half the Minimum Distance Plus One for the First-Order Reed-Muller Codes.- Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems.- A Note on a Class of Quadratic Permutations over .- Constructions of Orthonormal Lattices and Quaternion Division Algebras for Totally Real Number Fields.- Quaternary Plotkin Constructions and Quaternary Reed-Muller Codes.- Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes.- On the Key-Privacy Issue of McEliece Public-Key Encryption.- Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function.- Linear Complexity and Autocorrelation of Prime Cube Sequences.- The "Art of Trellis Decoding" Is NP-Hard.- On the Structure of Inversive Pseudorandom Number Generators.- Subcodes of Reed-Solomon Codes Suitable for Soft Decoding.- Normalized Minimum DeterminantCalculation for Multi-block and Asymmetric Space-Time Codes.- On the Computation of Non-uniform Input for List Decoding on Bezerra-Garcia Tower.- Dense MIMO Matrix Lattices - A Meeting Point for Class Field Theory and Invariant Theory.- Secure Cross-Realm Client-to-Client Password-Based Authenticated Key Exchange Against Undetectable On-Line Dictionary Attacks.- Links Between Discriminating and Identifying Codes in the Binary Hamming Space.- Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity.- A Path to Hadamard Matrices.- The Tangent FFT.- Novel Algebraic Structure for Cyclic Codes.- Distribution of Trace Values and Two-Weight, Self-orthogonal Codes over GF(p,2).- Generalized Rotation Symmetric and Dihedral Symmetric Boolean Functions ? 9 Variable Boolean Functions with Nonlinearity 242.- On Quasi-cyclic Codes over Integer Residue Rings.- Extended Norm-Trace Codes with Optimized Correction Capability.- On Generalized Hamming Weights and the Covering Radius of Linear Codes.- Homomorphic Encryptions of Sums of Groups.