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=5527

• The order bound for toric codes
  Peter Beelen, Diego Ruano
  Lecture Notes in Computer Science 5527, 2009, pp. 1-10
• An extension of the order bound for AG codes
  Iwan Duursma, Radoslav Kirov
  Lecture Notes in Computer Science 5527, 2009, pp. 11-22
• Sparse numerical semigroups
  C. Munuera, F. Torres, J. Villanueva
  Lecture Notes in Computer Science 5527, 2009, pp. 23-31
• From the Euclidean algorithm for solving a key equation for dual Reed-Solomon codes to the Berlekamp-Massey algorithm
  Maria Bras-Amorós, Michael E. O'Sullivan
  Lecture Notes in Computer Science 5527, 2009, pp. 32-42
• Rank for some families of quaternary Reed-Muller codes
  Jaume Pernas, Jaume Pujol, Mercè Villanueva
  Lecture Notes in Computer Science 5527, 2009, pp. 43-52
• Optimal bipartite Ramanujan graphs from balanced incomplete block designs: Their characterizations and applications to expander/LDPC codes
  Tom Hholdt, Heeralal Janwal
  Lecture Notes in Computer Science 5527, 2009, pp. 53-64
• Simulation of the sum-product algorithm using stratified sampling
  John Brevik, Michael E. O'Sullivan, Anya Umlauf, Rich Wolski
  Lecture Notes in Computer Science 5527, 2009, pp. 65-72
• A systems theory approach to periodically time-varying convolutional codes by means of their invariant equivalent
  Joan-Josep Climent, Victoria Herranz, Carmen Perea, Virtudes Tomás
  Lecture Notes in Computer Science 5527, 2009, pp. 73-82
• On elliptic convolutional Goppa codes
  José Ignacio Iglesias Curto
  Lecture Notes in Computer Science 5527, 2009, pp. 83-91
• The minimum Hamming distance of cyclic codes of length 2p^s
  Hakan Özadam, Ferruh Özbudak
  Lecture Notes in Computer Science 5527, 2009, pp. 92-100
• There are not non-obvious cyclic affine-invariant codes
  José Joaquín Bernal, Ángel del Río, Juan Jacobo Simón
  Lecture Notes in Computer Science 5527, 2009, pp. 101-106
• On self-dual codes over Z_{16}
  Kiyoshi Nagata, Fidel Nemenzo, Hideo Wada
  Lecture Notes in Computer Science 5527, 2009, pp. 107-116
• A non-Abelian group based on block upper triangular matrices with cryptographic applications
  Rafael Álvarez, Leandro Tortosa, José Vicent, Antonio Zamora
  Lecture Notes in Computer Science 5527, 2009, pp. 117-126
• Word oriented cascade jump \sigma - LFSR
  Guang Zeng, Yang Yang, Wenbao Han, Shuqin Fan
  Lecture Notes in Computer Science 5527, 2009, pp. 127-136
• On some sequences of the secret pseudo-random index j in RC4 key scheduling
  Riddhipratim Basu, Subhamoy Maitra, Goutam Paul, Tanmoy Talukdar
  Lecture Notes in Computer Science 5527, 2009, pp. 137-148
• Very-efficient anonymous password-authenticated key exchange and its extensions
  SeongHan Shin, Kazukuni Kobara, Hideki Imai
  Lecture Notes in Computer Science 5527, 2009, pp. 149-158
• Efficient constructions of deterministic encryption from hybrid encryption and code-based PKE
  Yang Cui, Kirill Morozov, Kazukuni Kobara, Hideki Imai
  Lecture Notes in Computer Science 5527, 2009, pp. 159-168
• Noisy interpolation of multivariate sparse polynomials in finite fields
  Álvar Ibeas, Arne Winterhof
  Lecture Notes in Computer Science 5527, 2009, pp. 169-178
• New commutative semifields and their nuclei
  Jürgen Bierbrauer
  Lecture Notes in Computer Science 5527, 2009, pp. 179-185
• Spreads in projective Hjelmslev geometries
  Ivan Landjev
  Lecture Notes in Computer Science 5527, 2009, pp. 186-194
• On the distribution of nonlinear congruential pseudorandom numbers of higher orders in residue rings
  Edwin D. El-Mahassni, Domingo Gomez
  Lecture Notes in Computer Science 5527, 2009, pp. 195-203
• Rooted trees searching for cocyclic Hadamard matrices over D_{4t}
  Víctor Álvarez, José Ándrés Armario, María Dolores Frau, Félix Gudiel, Amparo Osuna
  Lecture Notes in Computer Science 5527, 2009, pp. 204-214
• Interesting examples on maximal irreducible Goppa codes
  Marta Giorgetti
  Lecture Notes in Computer Science 5527, 2009, pp. 215-218
• Repeated root cyclic and negacyclic codes over Galois rings
  Sergio R. López-Permouth, Steve Szabo
  Lecture Notes in Computer Science 5527, 2009, pp. 219-222
• Construction of additive Reed-Muller codes
  Jaume Pujol, J. Rifà, L. Ronquillo
  Lecture Notes in Computer Science 5527, 2009, pp. 223-226