- 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.- Grobner 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.
- (source: Nielsen Book Data)
The AAECC symposia serieswas started in 1983by Alain Poli (Toulouse), who, together with R. Desq, D. Lazardand P. Camion, organizedthe ?rst conference. OriginallytheacronymAAECCstoodfor"AppliedAlgebraandError-Correct ing Codes."Overtheyearsitsmeaninghasshiftedto"AppliedAlgebra, Algebraic- gorithmsandError-CorrectingCodes, "re?ectingthegrowingimportanceofc- plexity, particularlyfor decoding algorithms.During the AAECC-12 symposium the ConferenceCommitteedecidedtoenforcethe theoryandpracticeofthe c- ing side as well as the cryptographic aspects. Algebra was conserved, as in the past, but slightly more oriented to algebraic geometry codes, ?nite ?elds, c- plexity, polynomials, andgraphs. The main topics for AAECC-18 were algebra, algebraiccomputation, codes and algebra, codes and combinatorics, modulation and codes, sequences, and cryptography. TheinvitedspeakersofthiseditionwereIwanDuursma, HenningStichtenoth, and Fernando Torres. We would like to express our deep regret for the loss of Professor Ralf Kotter, .. who recently passed away and could not be our fourth invited speaker. Except for AAECC-1 (Discrete Mathematics 56, 1985) and AAECC-7 (D- crete Applied Mathematics 33, 1991), the proceedings of all the symposia have been published in Springer'sLecture Notes in Computer Science (Vols. 228,229, 307, 356, 357, 508, 539, 673, 948, 1255, 1719, 2227, 2643, 3857, 4851). Itis apolicy ofAAECCto maintaina highscienti?c standard, comparableto that of a journal. This was made possible thanks to the many referees involved. Each submitted paper was evaluated by at least two international researchers. AAECC-18 received and refereed 50 submissions. Of these, 22 were selected for publication in these proceedings as regular papers and 7 were selected as extended abstracts.
(source: Nielsen Book Data)