Applicable Algebra in Engineering, Communication and Computing, Volume 9

Volume 9, Number 1, 1998

• Joachim Althaler, Arne Dür:
  A Generalization of the Massey-Ding Algorithm. 1-14
  
• Joachim von zur Gathen, Igor Shparlinski:
  Orders of Gauss Periods in Finite Fields. 15-24
  
• Joris van der Hoeven:
  Generic Asymptotic Expansions. 25-44
  
• Christian Ronse, Henk J. A. M. Heijmans:
  A Lattice-Theoretical Framework for Annular Filters in Morphological Image Processing. 45-89
  

Volume 9, Number 2, 1998

• J. F. Pommaret, Alban Quadrat:
  Generalized Bezout Identity. 91-116
  
• Daniel Mall:
  On the Relation Between Gröbner and Pommaret Bases. 117-123
  
• Harald Niederreiter, Michael Vielhaber:
  Simultaneous Shifted Continued Fraction Expansions in Quadratic Time. 125-138
  
• Hans Dobbertin:
  One-to-One Highly Nonlinear Power Functions on GF(2ⁿ). 139-152
  
• T. Aaron Gulliver, Patric R. J. Östergård:
  Improved Bounds for Quaternary Linear Codes of Dimension 6. 153-159
  
• Parampalli Udaya, M. U. Siddiqi:
  Optimal and Suboptimal Quadriphase Sequences Derived from Maximal Length Sequences over Z₄. 161-191
  

Volume 9, Number 3, 1998

• Ireneusz Sierocki:
  A Feedback Transformation of the Planning Problems. 193-209
  
• Patrick Fitzpatrick, Sylvia M. Jennings:
  Comparison of Two Algorithms for Decoding Alternant Codes. 211-220
  
• Nicolas Sendrier:
  On the Concatenated Structure of a Linear Code. 221-242
  
• Mark J. Encarnación:
  An Efficient Method for Computing Resultant Systems. 243-245
  
• Siguna Müller:
  A Note on Strong Dickson Pseudoprimes. 247-264
  
• Arnold Knopfmacher, J. N. Ridley, Gary L. Mullen:
  Nets and Sequences Obtained from Irreducible Polynomials Over Finite Fields. 265-269
  

Volume 9, Number 4, 1999

• Franz Pauer, Andreas Unterkircher:
  Gröbner Bases for Ideals in Laurent Polynomial Rings and their Application to Systems of Difference Equations. 271-291
  
• Agostino Dovier, Eugenio G. Omodeo, Alberto Policriti:
  Solvable Set/Hyperset Contexts: II. A Goal-Driven Unification Algorithm for the Blended Case. 293-332
  
• Maria C. F. Ferreira, Delia Kesner, Laurence Puel:
  lambda-Calculi with Explicit Substitutions Preserving Strong Normalization. 333-371
  

Volume 9, Number 5, 1999

• Harald Niederreiter, Chaoping Xing, Kwok-Yan Lam:
  A New Construction of Algebraic Geometry Codes. 373-381
  
• Stephen D. Cohen, Dirk Hachenberger:
  Primitive Normal Bases with Prescribed Trace. 383-403
  
• Paul Camion, Hervé Chabanne:
  On the Powerline System. 405-432
  
• Fabrice Rouillier:
  Solving Zero-Dimensional Systems Through the Rational Univariate Representation. 433-461
  

Volume 9, Number 6, 1999

• Guillermo Matera:
  Probabilistic Algorithms for Geometric Elimination. 463-520
  
• Xiao-an Wang, Stephen B. Wicker:
  The BCJR Trellis and Trellis Decoders for Some BCH Codes. 521-546
  
• Rumen N. Daskalov, T. Aaron Gulliver:
  Bounds on Minimum Distance for Linear Codes over GF(5). 547-558
  
• Manfred Göbel:
  Rewriting Techniques and Degree Bounds for Higher Order Symmetric Polynomials. 559-573