default search action
18. AAECC 2009: Tarragona, Catalonia, Spain
- Maria Bras-Amorós, Tom Høholdt:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 18th International Symposium, AAECC-18 2009, Tarragona, Catalonia, Spain, June 8-12, 2009. Proceedings. Lecture Notes in Computer Science 5527, Springer 2009, ISBN 978-3-642-02180-0
Codes
- Peter Beelen, Diego Ruano:
The Order Bound for Toric Codes. 1-10 - Iwan M. Duursma, Radoslav Kirov:
An Extension of the Order Bound for AG Codes. 11-22 - Carlos Munuera, Fernando Torres, Juan Elmer Villanueva:
Sparse Numerical Semigroups. 23-31 - Maria Bras-Amorós, Michael E. O'Sullivan:
From the Euclidean Algorithm for Solving a Key Equation for Dual Reed-Solomon Codes to the Berlekamp-Massey Algorithm. 32-42 - Jaume Pernas, Jaume Pujol, Mercè Villanueva:
Rank for Some Families of Quaternary Reed-Muller Codes. 43-52 - Tom Høholdt, Heeralal Janwa:
Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes. 53-64 - John Brevik, Michael E. O'Sullivan, Anya Umlauf, Richard Wolski:
Simulation of the Sum-Product Algorithm Using Stratified Sampling. 65-72 - Joan-Josep Climent, Victoria Herranz, Carmen Perea, Virtudes Tomás:
A Systems Theory Approach to Periodically Time-Varying Convolutional Codes by Means of Their Invariant Equivalent. 73-82 - José Ignacio Iglesias Curto:
On Elliptic Convolutional Goppa Codes. 83-91 - Hakan Özadam, Ferruh Özbudak:
The Minimum Hamming Distance of Cyclic Codes of Length 2ps. 92-100 - José Joaquín Bernal, Ángel del Río, Juan Jacobo Simón:
There Are Not Non-obvious Cyclic Affine-invariant Codes. 101-106 - Kiyoshi Nagata, Fidel R. Nemenzo, Hideo Wada:
On Self-dual Codes over Z16. 107-116
Cryptography
- Rafael Álvarez, Leandro Tortosa, José-Francisco Vicent, Antonio Zamora:
A Non-abelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications. 117-126 - Guang Zeng, Yang Yang, Wenbao Han, Shuqin Fan:
Word Oriented Cascade Jump sigma-LFSR. 127-136 - Riddhipratim Basu, Subhamoy Maitra, Goutam Paul, Tanmoy Talukdar:
On Some Sequences of the Secret Pseudo-random Index j in RC4 Key Scheduling. 137-148 - SeongHan Shin, Kazukuni Kobara, Hideki Imai:
Very-Efficient Anonymous Password-Authenticated Key Exchange and Its Extensions. 149-158 - Yang Cui, Kirill Morozov, Kazukuni Kobara, Hideki Imai:
Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE. 159-168
Algebra
- Álvar Ibeas, Arne Winterhof:
Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields. 169-178 - Jürgen Bierbrauer:
New Commutative Semifields and Their Nuclei. 179-185 - Ivan N. Landjev:
Spreads in Projective Hjelmslev Geometries. 186-194 - Edwin D. El-Mahassni, Domingo Gómez:
On the Distribution of Nonlinear Congruential Pseudorandom Numbers of Higher Orders in Residue Rings. 195-203 - Víctor Álvarez, José Andrés Armario, María Dolores Frau, Félix Gudiel, Amparo Osuna:
Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t. 204-214
Extended Abstracts
- Marta Giorgetti:
Interesting Examples on Maximal Irreducible Goppa Codes. 215-218 - Sergio R. López-Permouth, Steve Szabo:
Repeated Root Cyclic and Negacyclic Codes over Galois Rings. 219-222 - Jaume Pujol, Josep Rifà, Lorena Ronquillo:
Construction of Additive Reed-Muller Codes. 223-226 - Mijail Borges-Quintana, Miguel A. Borges-Trenard, Edgar Martínez-Moro:
Gröbner Representations of Binary Matroids. 227-230 - David M. Monarres, Michael E. O'Sullivan:
A Generalization of the Zig-Zag Graph Product by Means of the Sandwich Product. 231-234 - Lei Zhang, Bo Qin, Qianhong Wu, Futai Zhang:
Novel Efficient Certificateless Aggregate Signatures. 235-238 - Manabu Hagiwara, Takahiro Yoshida, Hideki Imai:
Bounds on the Number of Users for Random 2-Secure Codes. 239-242
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.