Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=539

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Algorithms for the shape of semialgebraic sets - a new approach
Paola Cellini, Patrizia Gianni, Carlo Traverso
Lecture Notes in Computer Science 539, 1991, pp. 1-18
On the parameters of algebraic geometric codes
H. Janwa
Lecture Notes in Computer Science 539, 1991, pp. 19-28
On Wiedemann's method of solving sparse linear systems
Erich Kaltofen, B. David Saunders
Lecture Notes in Computer Science 539, 1991, pp. 29-38
Fast algorithms for decoding orthogonal and related codes
Simon N. Litsyn
Lecture Notes in Computer Science 539, 1991, pp. 39-47
Jacobian matrices and constructions in algebra
Wolmer V. Vasconcelos
Lecture Notes in Computer Science 539, 1991, pp. 48-64
Homogenity, pseudo-homogenity, and Gröbner basis computations
Thomas Becker
Lecture Notes in Computer Science 539, 1991, pp. 65-73
Arithmetic on non supersingular elliptic curves
T. Beth, F. Schaefer
Lecture Notes in Computer Science 539, 1991, pp. 74-81
Implementing some algorithms of Kantor
Greg Butler
Lecture Notes in Computer Science 539, 1991, pp. 82-93
Computing roadmaps of general semi-algebraic sets
J.F. Canny
Lecture Notes in Computer Science 539, 1991, pp. 94-107
An improved sign determination algorithm
J.F. Canny
Lecture Notes in Computer Science 539, 1991, pp. 108-117
The 2-nd generalized Hamming weight of double-error correcting binary BCH codes and their dual codes
Habong Chung
Lecture Notes in Computer Science 539, 1991, pp. 118-129
Buchberger algorithm and integer programming
Pasqualina Conti, Carlo Traverso
Lecture Notes in Computer Science 539, 1991, pp. 130-139
New systolic architectures for cyclic code encoding
Menouer Diab
Lecture Notes in Computer Science 539, 1991, pp. 140-151
Algebraic constructions of efficient broadcast networks
Michael J. Dinneen, Michael R. Fellows, Vance Faber
Lecture Notes in Computer Science 539, 1991, pp. 152-158
Error-correction for WIMs and WUMs
C. van Eijl, G. Cohen, G. Zémor
Lecture Notes in Computer Science 539, 1991, pp. 159-170
Some constructions in rings of differential polynomials
Giovanni Gallo, Bhubaneswar Mishra, François Ollivier
Lecture Notes in Computer Science 539, 1991, pp. 171-182
Concurrent error detection in sequential circuits using convolutional codes
Lawrence P. Holmquist, L.L. Kinney
Lecture Notes in Computer Science 539, 1991, pp. 183-194
An algorithm for the computation of the radical of an ideal in the ring of polynomials
Teresa Krick, Alessandro Logar
Lecture Notes in Computer Science 539, 1991, pp. 195-205
Integer multiplication in PARSAC:2 on stock microprocessors
Wolfgang Kuechlin, David Lutz, Nicholas Nevin
Lecture Notes in Computer Science 539, 1991, pp. 206-217
Polynomial-time construction of spherical codes
Gilles Lachaud, Jacques Stern
Lecture Notes in Computer Science 539, 1991, pp. 218-223
Algorithms for a multiple algebraic extension II
Lars Langemyr
Lecture Notes in Computer Science 539, 1991, pp. 224-233
On the orphans and covering radius of the Reed-Muller codes
Philippe Langevin
Lecture Notes in Computer Science 539, 1991, pp. 234-240
A joint authentication and encryption scheme based on algebraic coding theory
Yuanxing Li, Xinmei Wang
Lecture Notes in Computer Science 539, 1991, pp. 241-245
Arithmetic codes -- Survey, recent and new results
Antoine C. Lobstein, Patrick Solé
Lecture Notes in Computer Science 539, 1991, pp. 246-258
Some results on linear unequal-error-protection codes specified by their generator matrix
Robert Morelos-Zaragoza, Shu Lin
Lecture Notes in Computer Science 539, 1991, pp. 259-268

Seiten 1 2 >