Volume 33, Numbers 1-3, November 1991
- H. F. Mattson Jr., Teo Mora:
Preface.
1-2
- Mahesh C. Bhandari, M. S. Garg:
A note on the covering radius of optimum codes.
3-9
- Leandro Caniglia, André Galligo, Joos Heintz:
Equations for the projective closure and effective Nullstellensatz.
11-23
- Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro:
Efficient q-ary immutable codes.
25-41
- John T. Coffey, Rodney M. Goodman, Patrick G. Farrell:
New approaches to reduced-complexity decoding.
43-60
- Pasqualina Conti, Carlo Traverso:
Computing the conductor of an integral extension.
61-72
- Alicia Dickenstein, Noaï Fitchas, Marc Giusti, Carmen Sessa:
The membership problem for unmixed polynomial ideals is solvable in single exponential time.
73-94
- Arne Dür:
Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6.
95-107
- Kevin Karplus, Habib Krit:
A semi-systolic decoder for the PDSC-73 error-correcting code.
109-128
- Ryuji Kohno, Hideki Imai:
Combination of decoding of error-correcting codes and equalization for channels with intersymbol interference.
129-146
- Daniel Lazard:
A new method for solving algebraic systems of positive dimension.
147-160
- Teo Mora:
La queste del saint Gra(AL): A computational approach to local algebra.
161-190
- Shojiro Sakata:
Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring.
191-203
- Alexei N. Skorobogatov:
The parameters of subcodes of algebraic-geometric codes over prime subfields.
205-214
- Patrick Solé, Arif Ghafoor:
The covering radius of doubled 2-designs in 2Ok.
215-224
- Walter Spangher:
On Bayer's deformation and the associativity formula.
225-233
- Vladimir D. Tonchev:
Self-dual codes and Hadamard matrices.
235-240
- Michael A. Tsfasman:
Algebraic-geometric codes and asymptotic problems.
241-256
- Branka Vucetic, Shu Lin:
Block coded modulation and concatenated coding schemes for error control on fading channels.
257-269
Last update Thu May 23 14:40:44 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
