default search action
8. AAECC 1990: Tokyo, Japan
- Shojiro Sakata:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 8th International Symposium, AAECC-8, Tokyo, Japan, August 20-24, 1990, Proceedings. Lecture Notes in Computer Science 508, Springer 1991, ISBN 3-540-54195-0
Invited Contributions
- Gérard D. Cohen:
Covering Radius and Writing on Memories. 1-10 - Joos Heintz, Teresa Krick, Marie-Françoise Roy, Pablo Solernó:
Geometric Problems Solvable in Single Exponential Time. 11-23
Submitted Contributions
Error Correcting Codes: Theory and Applications
- Juriaan Simonis:
A Description of the [16, 7, 6] Codes. 24-35 - Kazuhiko Yamaguchi, Hideki Imai:
Periodic Sequences for Absolute Type Shaft Encoders. 36-45 - George Sinaki:
Error-Coded Algorithms for On-Line Arithmetic. 46-58 - Yuichi Saitoh, Hideki Imai:
Constructions of Codes Correcting Burst Asymmetric Errors. 59-70 - Tae Nam Ahn, Kohichi Sakaniwa, T. R. N. Rao:
A Construction Method for m-ary Unidirectional Error Control Codes. 71-85 - Peizhong Lu, Song Guowen:
Feasible Calculation of the Generator for Combined LFSR Sequences. 86-95 - István Vajda, Tibor O. H. Nemetz:
Substitution of Characters in q-ary m-Sequences. 96-105 - Naoki Suehiro:
Pseudo-Polyphase Orthogonal Sequence Sets with Good Cross-Correlation Property. 106-112 - Shinya Matsufuji, Kyoki Imamura:
Real-Valued Bent Function and Its Application to the Design of Balanced Quadriphase Sequences with Optimal Correlation Properties. 113-121 - G. Schnabl, Martin Bossert:
Coded Modulation with Generalized Multiple Concatenation of Block Codes. 122-131 - Ryuji Kohno, Choonsik Yim, Hideki Imai:
Trellis Coded Modulation Based on Time-Varying Mapping and Encoders for Utilitzing a Channel Intersymbol Interference. 132-143 - N. M. Nikityuk:
Use of the Algebraic Coding Theory in Nuclear Electronics. 144-154 - John Abbott:
Some Ideas about Fault-Tolerant Chinese Remaindering. 155-163 - Josep Rifà-Coma:
On a Categorial Isomorphism between a Class of Completely Regular Codes and a Class of Distance Regular Graphs. 164-179
Computational Algebra and Geometry
- Joos Heintz, Marie-Françoise Roy, Pablo Solernó:
Single Exponential Path Finding in Semialgebraic Sets. Part 1: The Case of a Regular Bounded Hypersurface. 180-196 - Maria Emilia Alonso, Teo Mora, Mario Raimondo:
On the Complexity of Algebraic Power Series. 197-207 - Maria Emilia Alonso, Teo Mora, Mario Raimondo:
Local Decomposition Algorithms. 208-221 - Lars Langemyr:
An Asymptotically Fast Probabilitstic Algorithm for Computing Polynominal GCD's over an Algebraic Number Field. 222-233 - Bernard Mourrain:
Some Algebra with Formal Matrices. 234-248 - Michael Kalkbrenner:
Implicitization of Rational Parametric Curves and Surfaces. 249-259 - Philippe H. Glesser, Maurice Mignotte:
An Inequality about Irreducible Factors of Integer Polynominals (II). 260-266 - L. Beneteau:
The Symplectic Trilinear Mappings: An Algorithmic Approach of the Classification; Case of the Field GF(3). 267-279
Bases
- Shojiro Sakata:
A Gröbner Basis and a Minimal Polynominal Set of a Finite nD Array. 280-291 - Lorenzo Robbiano:
Bounds for Degrees and Number of Elements in Gröbner Bases. 292-303 - François Ollivier:
Standard Bases of Differential Ideals. 304-321 - Marc Giusti:
Complexity of Standard Bases in Projective Dimension Zero II. 322-328
Algorithms and Designs for Symbolic and Algebraic Computation
- Menouer Diab:
Systolic Architectures for Multiplication over Finite Field GF(2m). 329-340 - Wolfgang Küchlin:
PARSAC-2: A Parallel SAC-2 Based on Threads. 341-353 - Masakatu Morii, Yuzo Takamatsu:
Exponetiation in Finite Fields Using Dual Basis Multiplier. 354-366 - Gene Cooperman, Larry Finkelstein, N. Sarawagi:
Applications of Cayley Graphs. 367-378
Cryptography
- Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai:
Duality between Two Cryptographic Primitives. 379-390
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.