Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1255

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

Minimum distance decoding algorithms for linear codes
Alexander Barg
Lecture Notes in Computer Science 1255, 1997, pp. 1-14
Efficient multivariate factorization over finite fields
Laurent Bernardin, Michael B. Monagan
Lecture Notes in Computer Science 1255, 1997, pp. 15-28
On maximal codes in polynomial metric spaces
Peter Boyvalenkov, Danyo Danev
Lecture Notes in Computer Science 1255, 1997, pp. 29-38
Yet another ideal docomposition algorithm
Massimo Caboara, Pasqualina Conti, Carlo Traverso
Lecture Notes in Computer Science 1255, 1997, pp. 39-54
A resultant theory for ordinary algebraic differential equations
Giuseppa Carrà Ferro
Lecture Notes in Computer Science 1255, 1997, pp. 55-65
The symmetry group of Z^n_q in the Lee space and the Z_q^n-linear codes
Sueli Rodrigues Costa, João Roberto Gerônimo, Reginaldo, Jr. Palazzo, J. Carmelo Interlando, Marcelo Muniz Silva Alves
Lecture Notes in Computer Science 1255, 1997, pp. 66-77
On repeated-root cyclic codes and the two-way chain condition
Sylvia Encheva
Lecture Notes in Computer Science 1255, 1997, pp. 78-87
Exponentiation in finite fields: Theory and practice
Joachim von zur Gathen, Michael Nöcker
Lecture Notes in Computer Science 1255, 1997, pp. 88-113
Computing minimum-link path in a homotopy class amidst semi-algebraic obstacles in the plane
D. Grigoriev, A. Slissenko
Lecture Notes in Computer Science 1255, 1997, pp. 114-129
Certain self-dual codes over Z_4 and the odd Leech lattice
T. Aaron Gulliver, Masaaki Harada
Lecture Notes in Computer Science 1255, 1997, pp. 130-137
Order functions and evaluation codes
Tom Hohldt, Jacobus H. van Lint, Ruud Pellikaan
Lecture Notes in Computer Science 1255, 1997, pp. 138-150
Codes from cocycles
K.J. Horadam, A.A.I. Perera
Lecture Notes in Computer Science 1255, 1997, pp. 151-163
A brief tour of split linear programming
David B. Jaffe
Lecture Notes in Computer Science 1255, 1997, pp. 164-173
Elementary approximation of exponentials of Lie polynomials
Frédéric Jean, Pierre-Vincent Koseleff
Lecture Notes in Computer Science 1255, 1997, pp. 174-188
On the q-ary image of cyclic codes
Jrn M. Jensen
Lecture Notes in Computer Science 1255, 1997, pp. 189-196
The split weight (w_L,w_R) enumeration of Reed-Muller codes for w_L+w_R<2d_{min}
Tadao Kasami, Tsukasa Sugita, Toru Fujiwara
Lecture Notes in Computer Science 1255, 1997, pp. 197-211
Optimal linear codes of dimension 4 over GF(5)
Ivan N. Landjev
Lecture Notes in Computer Science 1255, 1997, pp. 212-220
Characterisations of lexicographic sets and simply-connected Hilbert schemes
Daniel Mall
Lecture Notes in Computer Science 1255, 1997, pp. 221-236
An iterative probabilistic decoding algorithm for binary linear block codes beyond the half minimum distance
Miodrag J. Mihaljević
Lecture Notes in Computer Science 1255, 1997, pp. 237-249
Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach
Miodrag J. Mihaljević
Lecture Notes in Computer Science 1255, 1997, pp. 250-262
Formal duality of linearly presentable codes over a Galois field
Alexander A. Nechaev, Alexey S. Kuzmin
Lecture Notes in Computer Science 1255, 1997, pp. 263-276
Trace-function on a Galois ring in coding theory
Alexander A. Nechaev, Alexey S. Kuzmin
Lecture Notes in Computer Science 1255, 1997, pp. 277-290
A vector version of the BMS algorithm for implementing fast erasure-and-error decoding of one-point AG codes
Shojiro Sakata
Lecture Notes in Computer Science 1255, 1997, pp. 291-310
On generalized Hamming weights of codes constructed on affine algebraic sets
Tomohar Shibuya, Jiro Mizutani, Kohichi Sakaniwa
Lecture Notes in Computer Science 1255, 1997, pp. 311-320
Some results on regular mappings
H. Tapia-Recillas, G. Vega, E. Daltabuit
Lecture Notes in Computer Science 1255, 1997, pp. 321-328

Seiten 1 2 >