|
|
|
|
LEADER |
05069nam a22005655i 4500 |
001 |
978-3-540-77224-8 |
003 |
DE-He213 |
005 |
20151204180926.0 |
007 |
cr nn 008mamaa |
008 |
100301s2007 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540772248
|9 978-3-540-77224-8
|
024 |
7 |
|
|a 10.1007/978-3-540-77224-8
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.9.D35
|
072 |
|
7 |
|a UMB
|2 bicssc
|
072 |
|
7 |
|a URY
|2 bicssc
|
072 |
|
7 |
|a COM031000
|2 bisacsh
|
082 |
0 |
4 |
|a 005.74
|2 23
|
245 |
1 |
0 |
|a Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
|h [electronic resource] :
|b 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007. Proceedings /
|c edited by Serdar Boztaş, Hsiao-Feng (Francis) Lu.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2007.
|
300 |
|
|
|a XII, 368 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4851
|
505 |
0 |
|
|a 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 Determinant Calculation 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.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Data structures (Computer science).
|
650 |
|
0 |
|a Data encryption (Computer science).
|
650 |
|
0 |
|a Coding theory.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computer science
|x Mathematics.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Data Structures, Cryptology and Information Theory.
|
650 |
2 |
4 |
|a Coding and Information Theory.
|
650 |
2 |
4 |
|a Data Encryption.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
700 |
1 |
|
|a Boztaş, Serdar.
|e editor.
|
700 |
1 |
|
|a Lu, Hsiao-Feng (Francis).
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540772231
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4851
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-540-77224-8
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|