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

• On homogeneous bent functions
  Chris Charnes, Martin Rötteler, Thomas Beth
  Lecture Notes in Computer Science 2227, 2001, pp. 249-259
• Partially identifying codes for copyright protection
  Sylvia Encheva, Gérard Cohen
  Lecture Notes in Computer Science 2227, 2001, pp. 260-267
• On the generalised hidden number problem and bit security of XTR
  Igor E. Shparlinski
  Lecture Notes in Computer Science 2227, 2001, pp. 268-277
• CRYPTIM: Graphs as tools for symmetric encryption
  Vasyl Ustimenko
  Lecture Notes in Computer Science 2227, 2001, pp. 278-286
• An algorithm for computing cocyclic matrices developed over some semidirect products
  V. Álvarez, J.A. Armario, M.D. Frau, P. Real
  Lecture Notes in Computer Science 2227, 2001, pp. 287-296
• Algorithms for large integer matrix problems
  Mark Giesbrecht, Michael, Jr. Jacobson, Arne Storjohann
  Lecture Notes in Computer Science 2227, 2001, pp. 297-307
• On the identification of vertices and edges using cycles
  Iiro Honkala, Mark G. Karpovsky, Simon Litsyn
  Lecture Notes in Computer Science 2227, 2001, pp. 308-314
• On algebraic soft decision decoding of cyclic binary codes
  Vladimir B. Balakirsky
  Lecture Notes in Computer Science 2227, 2001, pp. 315-322
• Lifting decoding schemes over a Galois ring
  Eimear Byrne
  Lecture Notes in Computer Science 2227, 2001, pp. 323-332
• Sufficient conditions on most likely local sub-codewords in recursive maximum likelihood decoding algorithms
  Tadao Kasami, Hitoshi Tokushige, Yuichi Kaji
  Lecture Notes in Computer Science 2227, 2001, pp. 333-342
• A unifying system-theoretic framework for errors-and-erasures Reed-Solomon decoding
  Margreta Kuijper, Marten van Dijk, Henk Hollmann, Job Oostveen
  Lecture Notes in Computer Science 2227, 2001, pp. 343-352
• An algorithm for computing rejection probability of MLD with threshold test over BSC
  Tadashi Wadayama
  Lecture Notes in Computer Science 2227, 2001, pp. 353-362
• Cartan's characters and stairs of characteristic sets
  François Boulier, Sylvain Neut
  Lecture Notes in Computer Science 2227, 2001, pp. 363-372
• On the invariants of the quotients of the Jacobian of a curve of genus 2
  P. Gaudry, É. Schost
  Lecture Notes in Computer Science 2227, 2001, pp. 373-386
• Algebraic constructions for PSK space-time coded modulation
  Andrew M. Guidi, Alex J. Grant, Steven S. Pietrobon
  Lecture Notes in Computer Science 2227, 2001, pp. 387-396