Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1719

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

Decoding Hermitian codes with Sudan's algorithm
T. Hholt, R. Refslund Nielsen
Lecture Notes in Computer Science 1719, 1999, pp. 260-270
Computing a basis of \cal L(D) on an affine algebraic curve with one rational place at infinity
Ryutaroh Matsumoto, Shinji Miura
Lecture Notes in Computer Science 1719, 1999, pp. 271-281
Critical noise for convergence of iterative probabilistic decoding with belief propagation in cryptographic applications
Marc P.C. Fossorier, Miodrag J. Mihaljević, Hideki Imai
Lecture Notes in Computer Science 1719, 1999, pp. 282-293
An authentication scheme over non-authentic public channel in information-theoretic secret-key agreement
Shengli Liu, Yumin Wang
Lecture Notes in Computer Science 1719, 1999, pp. 294-301
A systolic array architecture for fast decoding of one-point AG codes and scheduling of parallel processing on it
Shojiro Sakata, Masazumi Kurihara
Lecture Notes in Computer Science 1719, 1999, pp. 302-313
Computing weight distributions of convolutional codes via shift register synthesis
Mehul Motani, Chris Heegard
Lecture Notes in Computer Science 1719, 1999, pp. 314-323
Properties of finite response input sequences of recursive convolutional codes
Didier Le Ruyet, Hong Sun, Han Vu Thien
Lecture Notes in Computer Science 1719, 1999, pp. 324-333
Lower bounds for group covering designs
K.K.P. Chanduka, Mahesh C. Bhandari, Arbind K. Lal
Lecture Notes in Computer Science 1719, 1999, pp. 334-345
Characteristic functions of relative difference sets, correlated sequences and Hadamard matrices
Garry Hughes
Lecture Notes in Computer Science 1719, 1999, pp. 346-354
Double circulant self-dual codes using finite-field wavelet transforms
F. Fekri, S.W. McLaughlin, R.M. Mersereau, R.W. Schafer
Lecture Notes in Computer Science 1719, 1999, pp. 355-364
Linear codes and polylinear recurrences over finite rings and modules (a survey)
V.L. Kurakin, A.S. Kuzmin, V.T. Markov, A.V. Mikhalev, A.A. Nechaev
Lecture Notes in Computer Science 1719, 1999, pp. 365-391
Calculating generators for invariant fields of linear algebraic groups
Jörn Müller-Quade, Thomas Beth
Lecture Notes in Computer Science 1719, 1999, pp. 392-403
Constructing elements of large order in finite fields
Joachim von zur Gathen, Igor Shparlinski
Lecture Notes in Computer Science 1719, 1999, pp. 404-409
New lower bounds on the periodic crosscorrelation of QAM codes with arbitrary energy
Serdar Boztag
Lecture Notes in Computer Science 1719, 1999, pp. 410-419
Conjectures on the size of constellations constructed from direct sums of PSK kernerls
Matthew G. Parker
Lecture Notes in Computer Science 1719, 1999, pp. 420-429
A new criterion for normal form algorithms
B. Mourrain
Lecture Notes in Computer Science 1719, 1999, pp. 430-443
Discrete Fourier transform and Gröbner bases
A. Poli, M.C. Gennero, D. Xin
Lecture Notes in Computer Science 1719, 1999, pp. 444-453
On the state complexities of ternary codes
Sylvia Encheva, Gérard Cohen
Lecture Notes in Computer Science 1719, 1999, pp. 454-461
Binary optimal linear rate 1/2 codes
Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada
Lecture Notes in Computer Science 1719, 1999, pp. 462-471
On binary-ternary error-correcting codes with minimum distance 4
Patric R.J. Östergård
Lecture Notes in Computer Science 1719, 1999, pp. 472-481
The Euclidean algorithm and primitive polynomials over finite fields
James W. Bond, Stefen Hui, Hank Schmidt
Lecture Notes in Computer Science 1719, 1999, pp. 482-491
On the computational hardness of testing square-freeness of sparse polynomials
Marek Karpinski, Igor Shparlinski
Lecture Notes in Computer Science 1719, 1999, pp. 492-497
Mastrovito multiplier for general irreducible polynomials
A. Halbutoğullari, Ç.K. Koç
Lecture Notes in Computer Science 1719, 1999, pp. 498-507

Seiten < 1 2