Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Series=LNCS AND Volume=1719
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Codes on graphs: A survey for algebraists
G. David Jr. Forney
Lecture Notes in Computer Science
1719
, 1999, pp. 1-9
RA codes achieve AWGN channel capacity
Hui Jin
,
Robert J. McEliece
Lecture Notes in Computer Science
1719
, 1999, pp. 10-18
Monomial ideals and planar graphs
Ezra Miller
,
Bernd Sturmfels
Lecture Notes in Computer Science
1719
, 1999, pp. 19-28
A fast program generator of fast Fourier transforms
Michael Clausen
,
Meinard Müller
Lecture Notes in Computer Science
1719
, 1999, pp. 29-42
On integer programming problems related to soft-decision iterative decoding algorithms
Tadao Kasami
Lecture Notes in Computer Science
1719
, 1999, pp. 43-54
Curves with many points and their applications
Ian F. Blake
Lecture Notes in Computer Science
1719
, 1999, pp. 55-64
New sequences of linear time erasure codes approaching the channel capacity
M. Amin Shokrollahi
Lecture Notes in Computer Science
1719
, 1999, pp. 65-76
On the theory of low-density convolutional codes
Karin Engdahl
,
Michael Lentmaier
,
Kamil Sh. Zigangirov
Lecture Notes in Computer Science
1719
, 1999, pp. 77-86
On the distribution of nonlinear recursive congruential pseudorandom numbers of higher orders
Frances Griffin
,
Harald Niederreiter
,
Igor E. Shparlinski
Lecture Notes in Computer Science
1719
, 1999, pp. 87-93
A new representation of Boolean functions
Claude Carlet
,
Philippe Guillot
Lecture Notes in Computer Science
1719
, 1999, pp. 94-103
An algorithm to compute a nearest point in the lattice
A^*_n
I. Vaughan
,
L. Clarkson
Lecture Notes in Computer Science
1719
, 1999, pp. 104-120
Sequences from cocycles
K.J. Horadam
Lecture Notes in Computer Science
1719
, 1999, pp. 121-130
On the second greedy weight for binary linear codes
Wende Chen
,
Torleiv Klve
Lecture Notes in Computer Science
1719
, 1999, pp. 131-141
On the size of identifying codes
Uri Blass
,
Iiro Honkala
,
Simon Litsyn
Lecture Notes in Computer Science
1719
, 1999, pp. 142-147
Fast quantum Fourier transforms for a class of non-Abelian groups
Markus Püschel
,
Martin Rötteler
,
Thomas Beth
Lecture Notes in Computer Science
1719
, 1999, pp. 148-159
Linear codes and rings of matrices
M. Greferath
,
S.E. Schmidt
Lecture Notes in Computer Science
1719
, 1999, pp. 160-169
On
Z_4
-simplex codes and their Gray images
Mahesh C. Bhandari
,
Manish K. Gupta
,
Arbind K. Lal
Lecture Notes in Computer Science
1719
, 1999, pp. 170-180
Some results on generalized concatenation of block codes
M. Bossert
,
H. Griess̈er
,
J. Maucher
,
V.V. Zyablov
Lecture Notes in Computer Science
1719
, 1999, pp. 181-190
Near optimal decoding for TCM using the BIVA and trellis shaping
Qi Wang
,
Lei Wei
,
Rodney A. Kennedy
Lecture Notes in Computer Science
1719
, 1999, pp. 191-200
An optmality testing algorithm for a decoded codeword of binary block codes and its computational complexity
Yuansheng Tang
,
Tadao Kasami
,
Toru Fujiwara
Lecture Notes in Computer Science
1719
, 1999, pp. 201-210
Recursive MDS-codes and pseudogeometries
Elena Couselo
,
Santos Gonzalez
,
Victor Markov
,
Alexandr Nechaev
Lecture Notes in Computer Science
1719
, 1999, pp. 211-220
Strength of MISTY1 without FL function for higher order differential attack
Hidema Tanaka
,
Kazuyuki Hisamatsu
,
Toshinobu Kaneko
Lecture Notes in Computer Science
1719
, 1999, pp. 221-230
Quantum Reed-Solomon codes
Markus Grassl
,
Willi Geiselmann
,
Thomas Beth
Lecture Notes in Computer Science
1719
, 1999, pp. 231-244
Capacity bounds for the 3-dimensional
(0,1)
runlength limited channel
Zsigmond Nagy
,
Kenneth Zeger
Lecture Notes in Computer Science
1719
, 1999, pp. 245-251
Rectangular codes and rectangular algebra
V. Sidorenko
,
J. Maucher
,
M. Bossert
Lecture Notes in Computer Science
1719
, 1999, pp. 252-259
Seiten 1
2
>