Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=508

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

Covering radius and writing on memories.
Gérard D. Cohen
Lecture Notes in Computer Science 508, 1991, pp. 1-10
Geometric problems solvable in single exponential time.
Joos Heintz, Teresa Krick, Marie-Françoise Roy, Pablo Solernó
Lecture Notes in Computer Science 508, 1991, pp. 11-23
A description of the [16,7,6] codes.
Juriaan Simonis
Lecture Notes in Computer Science 508, 1991, pp. 24-35
Periodic sequences for absolute type shaft encoders
Kazuhiko Yamaguchi, Hideki Imai
Lecture Notes in Computer Science 508, 1991, pp. 36-45
Error-coded algorithms for on-line arithmetic
George Sinaki
Lecture Notes in Computer Science 508, 1991, pp. 46-58
Constructions of codes correcting burst asymmetric errors.
Yuichi Saitoh, Hideki Imai
Lecture Notes in Computer Science 508, 1991, pp. 59-70
A construction method for m-ary unidirectional error control codes - Application for m-ary Berger check to asymmetric error control codes
Tae Nam Ahn, Kohichi Sakaniwa, T.R.N. Rao
Lecture Notes in Computer Science 508, 1991, pp. 71-85
Feasible calculation of the generator for combined LFSR sequences
Lu Peizhong, Song Guowen
Lecture Notes in Computer Science 508, 1991, pp. 86-95
Substitution of characters in q-ary m-sequences
István Vajda, Tibor Nemetz
Lecture Notes in Computer Science 508, 1991, pp. 96-105
Pseudo-polyphase orthogonal sequence sets with good cross-correlation property
Naoki Suehiro
Lecture Notes in Computer Science 508, 1991, pp. 106-112
Real-valued bent function and its application to the design of balanced quadriphase sequences with optimal correlation properties
Shinya Matsufuji, Kyoki Imamura
Lecture Notes in Computer Science 508, 1991, pp. 113-121
Coded modulation with generalized multiple concatenation of block codes
G. Schnabl, M. Bossert
Lecture Notes in Computer Science 508, 1991, pp. 122-131
Trellis coded modulation based on time-varying mapping and encoders for utilizing a channel intersymbol interference
Ryuji Kohno, Choonsik Yim, Hideki Imai
Lecture Notes in Computer Science 508, 1991, pp. 132-143
Use of the algebraic coding theory in nuclear electronics
N.M. Nikityuk
Lecture Notes in Computer Science 508, 1991, pp. 144-154
Some ideas about fault-tolerant Chinese remaindering
John Abbott
Lecture Notes in Computer Science 508, 1991, pp. 155-163
On a categorial isomorphism between a class of completely regular codes and a class of distance regular graphs
Josep Rifà-Coma
Lecture Notes in Computer Science 508, 1991, pp. 164-179
Single exponential path finding in semialgebraic sets - Part I: The case of a regular bounded hypersurface
Joos Heintz, Marie-Francoise Roy, Pablo Solernó
Lecture Notes in Computer Science 508, 1991, pp. 180-196
On the complexity of algebraic power series
M.E. Alonso, T. Mora, M. Raimondo
Lecture Notes in Computer Science 508, 1991, pp. 197-207
Local decomposition algorithms
Maria Emilia Alonso, Teo Mora, Mario Raimondo
Lecture Notes in Computer Science 508, 1991, pp. 208-221
An asymptotically fast probabilistic algorithm for computing polynomial GCD'S over an algebraic number field.
Lars Langemyr
Lecture Notes in Computer Science 508, 1991, pp. 222-233
Some algebra with formal matrices
Bernard Mourrain
Lecture Notes in Computer Science 508, 1991, pp. 234-248
Implicitization of rational parametric curves and surfaces
Michael Kalkbrener
Lecture Notes in Computer Science 508, 1991, pp. 249-259
An inequality about irreducible factors of integer polynomials (II)
Philippe Glesser, Maurice Mignotte
Lecture Notes in Computer Science 508, 1991, pp. 260-266
The symplectic trilinear mappings; An algorithmic approach of the classification; Case of the field GF(3)
L. Beneteau
Lecture Notes in Computer Science 508, 1991, pp. 267-279
A Gröbner basis and a minimal polynomial set of a finite nD array
Shojiro Sakata
Lecture Notes in Computer Science 508, 1991, pp. 280-291

Seiten 1 2 >