Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006. Proceedings

Free Download

Authors:

Edition: 1

Series: Lecture Notes in Computer Science 3857 : Theoretical Computer Science and General Issues

ISBN: 3540314237, 9783540314233

Size: 4 MB (4144987 bytes)

Pages: 344/347

File format:

Language:

Publishing Year:

Category: Tags: , , , , ,

Claude Carlet (auth.), Marc P. C. Fossorier, Hideki Imai, Shu Lin, Alain Poli (eds.)3540314237, 9783540314233

This book constitutes the refereed proceedings of the 16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16, held in Las Vegas, NV, USA in February 2006.

The 25 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 32 submissions. Among the subjects addressed are block codes; algebra and codes: rings, fields, and AG codes; cryptography; sequences; decoding algorithms; and algebra: constructions in algebra, Galois groups, differential algebra, and polynomials.


Table of contents :
Front Matter….Pages –
On Bent and Highly Nonlinear Balanced/Resilient Functions and Their Algebraic Immunities….Pages 1-28
On Generalized Parity Checks….Pages 29-34
Cryptography Based on Bilinear Maps….Pages 35-50
The Merit Factor Problem for Binary Sequences….Pages 51-59
Quantum Period Reconstruction of Binary Sequences….Pages 60-67
The Vector Key Equation and Multisequence Shift Register Synthesis….Pages 68-75
A General Framework for Applying FGLM Techniques to Linear Codes….Pages 76-86
A Theory of Highly Nonlinear Functions….Pages 87-100
The Solutions of the Third Power Sum Equation for Niho Type Decimations….Pages 101-107
On Constructing AG Codes Without Basis Functions for Riemann-Roch Spaces….Pages 108-117
Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points….Pages 118-127
A Class of Fermat Curves for which Weil-Serre’s Bound Can Be Improved….Pages 128-135
Nonbinary Quantum Codes from Hermitian Curves….Pages 136-143
A Genetic Algorithm for Cocyclic Hadamard Matrices….Pages 144-153
Unconditionally Secure Chaffing-and-Winnowing: A Relationship Between Encryption and Authentication….Pages 154-162
A Fast Calculus for the Linearizing Attack and Its Application to an Attack on KASUMI….Pages 163-172
On Achieving Chosen Ciphertext Security with Decryption Errors….Pages 173-182
Applying Fujisaki-Okamoto to Identity-Based Encryption….Pages 183-192
A Short Random Fingerprinting Code Against a Small Number of Pirates….Pages 193-202
A General Formulation of Algebraic and Fast Correlation Attacks Based on Dedicated Sample Decimation….Pages 203-214
Traitor Tracing Against Powerful Attacks Using Combinatorial Designs….Pages 215-224
New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems….Pages 225-234
LDPC Codes for Fading Channels: Two Strategies….Pages 235-244
Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping….Pages 245-254
Algebraic Constructions of Quasi-cyclic LDPC Codes – Part I: For AWGN and Binary Random Erasure Channels….Pages 255-264
Algebraic Construction of Quasi-cyclic LDPC Codes – Part II: For AWGN and Binary Random and Burst Erasure Channels….Pages 265-274
New Constructions of Quasi-cyclic LDPC Codes Based on Two Classes of Balanced Incomplete Block Designs: For AWGN and Binary Erasure Channels….Pages 275-284
Long Extended BCH Codes Are Spanned by Minimum Weight Words….Pages 285-294
On the Feng-Rao Bound for Generalized Hamming Weights….Pages 295-306
Nested Codes for Constrained Memory and for Dirty Paper….Pages 307-316
Complementary Sets and Reed-Muller Codes for Peak-to-Average Power Ratio Reduction in OFDM….Pages 317-327
Hadamard Codes of Length 2 t s ( s Odd). Rank and Kernel….Pages 328-337
Back Matter….Pages –

Reviews

There are no reviews yet.

Be the first to review “Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006. Proceedings”
Shopping Cart
Scroll to Top