default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6. AAECC 1988: Rome, Italy
- Teo Mora:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 6th International Conference, AAECC-6, Rome, Italy, July 4-8, 1988, Proceedings. Lecture Notes in Computer Science 357, Springer 1989, ISBN 3-540-51083-4
Invited Contributions
- E. F. Assmus Jr.:
The Coding Theory of Finite Geometries and Designs. 1-6 - Jacobus H. van Lint:
Recent Results on Covering Problems. 7-21 - Jean-Francis Michon:
Codes and Curves. 22-30 - Lorenzo Robbiano:
Computer and Commutative Algebra. 31-44 - Claus-Peter Schnorr:
The Multiplicative Complexity of Boolean Functions. 45-58
Full Papers
- Maria Emilia Alonso
, I. Luengo-Velasco, Mario Raimondo:
An Algorithm on Quasi-Ordinary Polynomials. 59-73 - Jean-Pierre Barbot:
A Computer-Aided Design for Sampling a Non-Linear Analytic System. 74-88 - Martin Bossert:
Decoding of Generalized Concatenated Codes. 89-98 - Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom Jr.:
Backtrack Searching in the Presence of Symmetry. 99-110 - Marco Bucci, Adina di Porto:
Fast Serial-Parallel Multipliers. 111-121 - Johannes Buchmann, Michael Pohst:
On the Complexity of Computing Class Groups of Algebraic Number Fields. 122-130 - Leandro Caniglia, André Galligo, Joos Heintz:
Some New Effectivity Bounds in Computational Geometry. 131-151 - Giuseppa Carrà Ferro:
Some Remarks on the Differential Dimension. 152-163 - Guy Castagnoli:
On the Asymptotic Badness of Cyclic Codes with Block-Lengths Composed from a Fixed Set of Prime Factors. 164-168 - Attilio Colagrossi, Carla Limongelli:
Big Numbers p-adic Arithmetic: A Parallel Approach. 169-180 - Vesselin Drensky, Piroska Lakatos:
Monomial Ideals, Group Algebras and Error Correcting Codes. 181-188 - Ricardo Ferré:
Fast Integer Multiplication by Block Recursive, Number Theoretical Transforms. 189-200 - Philippe Flajolet, Bruno Salvy, Paul Zimmermann:
Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer. 201-212 - Tatiana Gateva-Ivanova:
Global Dimension of Associative Algebras. 213-229 - Willi Geiselmann, Dieter Gollmann:
Symmetry and Duality in Normal Basis Multiplication. 230-238 - Werner Henkel:
Multiple Error Correction with Analog Codes. 239-249 - Harry B. Hunt III, Richard Edwin Stearns:
On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report). 250-258 - Alessandro Logar:
A Computational Proof of the Noether Normalization Lemma. 259-273 - Jed Marti:
A Graphics Interface to REDUCE. 274-296 - Edoardo D. Mastrovito:
VLSI Designs for Multiplication over Finite Fields GF (2m). 297-309 - Preda Mihailescu:
A Primality Test Using Cyclotomic Extensions. 310-323 - N. M. Nikityuk:
The Method of Syndrome Coding and its Application for Data Compression and Processing in High Energy Physics Experiments. 324-335 - Giulia Maria Piacentini Cattaneo:
Nonassociative Degree Five Identities not Implied by Commutativity: a Computer Approach. 336-340 - Josep Rifà, Josep M. Basart, Llorenç Huguet i Rotger:
On Completely Regular Propelinear Codes. 341-355 - Shojiro Sakata:
N-Dimensional Berlekamp-Massey Algorithm for Multiple Arrays and Construction of Multivariate Polynomials with Preassigned Zeros. 356-376 - Juriaan Simonis:
Covering Radius: Improving on the Sphere-Covering Bound. 377-385 - William Y. Sit:
On Goldman's Algorithm for Solving First-Order Multinomial Autonomous Systems. 386-395 - Patrick Solé, Arif Ghafoor:
A Covering Problem in the Odd Graphs. 396-406 - Walter Spangher:
On the Computation of Hilbert-Samuel Series and Multiplicity. 407-414 - Jacobo Torán:
Succinct Representations of Counting Problems. 415-426 - Philippe Toffin, Marc Girault, Brigitte Vallée:
How to Guess l-th Roots Modulo n by Reducing Lattice Bases. 427-442 - Kazuhiko Yamaguchi, Hideki Imai:
A Study on Imai-Hirakawa Trellis-Coded Modulation Schemes. 443-453
Extended Abstracts
- Sabina Bonamico, Gianna Cioni:
Embedding Flexible Control Strategies into Object Oriented Languages. 454-457 - Paul Camion:
Majority Decoding of Large Repetition Codes for the R-Ary Symmetric Channel. 458-466 - Bertrand Courteau, André Montpetit:
On Binary Codes of Order 3. 467-470 - Jaime Gutierrez, Tomás Recio, C. Ruiz de Velasco:
Polynomial Decomposition Algorithm of Almost Quadratic Complexity. 471-475 - Jacques Wolfmann:
The Weights of the Orthogonals of Certain Cyclic Codes of Extended Goppa Codes. 476-480
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.
last updated on 2026-08-09 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
