Applied Algebra, Algebraic Algorithms and Error-Correcting Codes 18th International Symposium, AAECC-18 2009, Tarragona, Spain, June 8-12, 2009. Proceedings /

This book constitutes the refereed proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-18, held in Tarragona, Spain, in June 2009. The 22 revised full papers presented together with 7 extended absstracts were carefully reviewed a...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Bras-Amorós, Maria (Επιμελητής έκδοσης), Høholdt, Tom (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
Σειρά:Lecture Notes in Computer Science, 5527
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04803nam a22005775i 4500
001 978-3-642-02181-7
003 DE-He213
005 20151103121013.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 |a 9783642021817  |9 978-3-642-02181-7 
024 7 |a 10.1007/978-3-642-02181-7  |2 doi 
040 |d GrThAP 
050 4 |a QA268 
072 7 |a GPJ  |2 bicssc 
072 7 |a GPF  |2 bicssc 
072 7 |a COM031000  |2 bisacsh 
082 0 4 |a 003.54  |2 23 
245 1 0 |a Applied Algebra, Algebraic Algorithms and Error-Correcting Codes  |h [electronic resource] :  |b 18th International Symposium, AAECC-18 2009, Tarragona, Spain, June 8-12, 2009. Proceedings /  |c edited by Maria Bras-Amorós, Tom Høholdt. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2009. 
300 |a IX, 243 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 5527 
505 0 |a Codes -- The Order Bound for Toric Codes -- An Extension of the Order Bound for AG Codes -- Sparse Numerical Semigroups -- From the Euclidean Algorithm for Solving a Key Equation for Dual Reed–Solomon Codes to the Berlekamp–Massey Algorithm -- Rank for Some Families of Quaternary Reed-Muller Codes -- Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes -- Simulation of the Sum-Product Algorithm Using Stratified Sampling -- A Systems Theory Approach to Periodically Time-Varying Convolutional Codes by Means of Their Invariant Equivalent -- On Elliptic Convolutional Goppa Codes -- The Minimum Hamming Distance of Cyclic Codes of Length 2p s -- There Are Not Non-obvious Cyclic Affine-invariant Codes -- On Self-dual Codes over Z 16 -- Cryptography -- A Non-abelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications -- Word Oriented Cascade Jump ??LFSR -- On Some Sequences of the Secret Pseudo-random Index j in RC4 Key Scheduling -- Very-Efficient Anonymous Password-Authenticated Key Exchange and Its Extensions -- Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE -- Algebra -- Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields -- New Commutative Semifields and Their Nuclei -- Spreads in Projective Hjelmslev Geometries -- On the Distribution of Nonlinear Congruential Pseudorandom Numbers of Higher Orders in Residue Rings -- Rooted Trees Searching for Cocyclic Hadamard Matrices over D 4t -- Extended Abstracts -- Interesting Examples on Maximal Irreducible Goppa Codes -- Repeated Root Cyclic and Negacyclic Codes over Galois Rings -- Construction of Additive Reed-Muller Codes -- Gröbner Representations of Binary Matroids -- A Generalization of the Zig-Zag Graph Product by Means of the Sandwich Product -- Novel Efficient Certificateless Aggregate Signatures -- Bounds on the Number of Users for Random 2-Secure Codes. 
520 |a This book constitutes the refereed proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-18, held in Tarragona, Spain, in June 2009. The 22 revised full papers presented together with 7 extended absstracts were carefully reviewed and selected from 50 submissions. Among the subjects addressed are block codes, including list-decoding algorithms; algebra and codes: rings, fields, algebraic geometry codes; algebra: rings and fields, polynomials, permutations, lattices; cryptography: cryptanalysis and complexity; computational algebra: algebraic algorithms and transforms; sequences and boolean functions. 
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 Computer science  |x Mathematics. 
650 0 |a Algorithms. 
650 1 4 |a Computer Science. 
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 Symbolic and Algebraic Manipulation. 
650 2 4 |a Data Structures, Cryptology and Information Theory. 
650 2 4 |a Algorithms. 
700 1 |a Bras-Amorós, Maria.  |e editor. 
700 1 |a Høholdt, Tom.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642021800 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5527 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-02181-7  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)