12. AAECC 1997:
Toulouse,
France
Teo Mora, Harold F. Mattson (Eds.):
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 12th International Symposium, AAECC-12, Toulouse, France, June 23-27, 1997, Proceedings.
Lecture Notes in Computer Science 1255 Springer 1997, ISBN 3-540-63163-1 BibTeX
@proceedings{DBLP:conf/aaecc/1997,
editor = {Teo Mora and
Harold F. Mattson},
title = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes,
12th International Symposium, AAECC-12, Toulouse, France, June
23-27, 1997, Proceedings},
booktitle = {AAECC},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1255},
year = {1997},
isbn = {3-540-63163-1},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Alexander Barg:
Minimum Distance Decoding Algorithms for Linear Codes.
1-14 BibTeX
- Laurent Bernardin, Michael B. Monagan:
Efficient Multivariate Factorization over Finite Fields.
15-28 BibTeX
- Peter Boyvalenkov, Danyo Danev:
On Maximal Codes in Polynominal Metric Spaces.
29-38 BibTeX
- Massimo Caboara, Pasqualina Conti, Carlo Traverso:
Yet Another Ideal Decomposition Algorithm.
39-54 BibTeX
- Giuseppa Carrà Ferro:
A Resultant Theory for Ordinary Algebraic Differential Equations.
55-65 BibTeX
- Sueli I. Rodrigues Costa, João Roberto Gerônimo, Reginaldo Palazzo Jr., J. Carmelo Interlando, Marcelo Muniz Silva Alves:
The Symmetry Group of Znq in the Lee Space and the Zqn-Linear Codes.
66-77 BibTeX
- Sylvia B. Encheva:
On Repeated-Root Cyclic Codes and the Two-Way Chain Condition.
78-87 BibTeX
- Joachim von zur Gathen, Michael Nöcker:
Exponentiation in Finite Fields: Theory and Practice.
88-113 BibTeX
- Dima Grigoriev, Anatol Slissenko:
Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane.
114-129 BibTeX
- T. Aaron Gulliver, Masaaki Harada:
Certain Self-Dual Codes over Z4 and the Odd Leech Lattice.
130-137 BibTeX
- Tom Høholdt, Jacobus H. van Lint, Ruud Pellikaan:
Order Functions and Evaluation Codes.
138-150 BibTeX
- Kathy J. Horadam, A. A. I. Perera:
Codes from Cocycles.
151-163 BibTeX
- David B. Jaffe:
A Brief Tour of Split Linear Programming.
164-173 BibTeX
- Frédéric Jean, Pierre-Vincent Koseleff:
Elementary Approximation of Exponentials of Lie Polynominals.
174-188 BibTeX
- Jørn M. Jensen:
On the q-ary Image of Cyclic Codes.
189-196 BibTeX
- Tadao Kasami, Tsukasa Sugita, Toru Fujiwara:
The Split Weight (wL, wR) Enumeration of Reed-Muller Codes for wL + wR < 2dmin.
197-211 BibTeX
- Ivan N. Landjev:
Optimal Linear Codes of Dimension 4 over GF(5).
212-220 BibTeX
- Daniel Mall:
Characterisations of Lexicographic Sets and Simply-Connected Hilbert Schemes.
221-236 BibTeX
- Miodrag J. Mihaljevic:
An Iterative Probabilistic Decoding Algorithm for Binary Linear Block Codes Beyond the Half Minimum Distance.
237-249 BibTeX
- Miodrag J. Mihaljevic:
Security Examination of a Cellular Automata Based Pseudorandom Bit Generator Using an Algebraic Replica Approach.
250-262 BibTeX
- Alexander A. Nechaev, Alexey S. Kuzmin:
Formal Duality of Linearly Presentable Codes over a Galois Field.
263-276 BibTeX
- Alexander A. Nechaev, Alexey S. Kuzmin:
Trace-Function on a Galois Ring in Coding Theory.
277-290 BibTeX
- Shojiro Sakata:
A Vector Version of the BMS Algorithm for Implementing Fast Erasure-and-Error Decoding of One-Point AG Codes.
291-310 BibTeX
- Tomoharu Shibuya, Jiro Mizutani, Kohichi Sakaniwa:
On Generalized Hamming Weights of Codes Constructed on Affine Algebraic Sets.
311-320 BibTeX
- Horacio Tapia-Recillas, Gerardo Vega, Enrique Daltabuit:
Some Results on Regular Mappings.
321-328 BibTeX
- Jay A. Wood:
Extension Theorems for Linear Codes over Finite Rings.
329-340 BibTeX
- Shutao Xia, Fangwei Fu:
Nonperiodic Cyclic Equivalence Classes of Cyclic Codes and Algebraic Constructions of Cyclically Permutable Codes.
341-352 BibTeX
Copyright © Sat May 16 22:55:35 2009
by Michael Ley (ley@uni-trier.de)
