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: Booktitle=Proceedings of the 17th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC'2007 (Bangalore, India, December 16-20, 2007)

• List decoding and pseudorandom constructions
  Venkatesan Guruswami
  Lecture Notes in Computer Science 4851, 2007, pp. 1-6
• A survey of recent attacks on the filter generator
  Sondre Rnjom, Guang Gong, Tor Helleseth
  Lecture Notes in Computer Science 4851, 2007, pp. 7-17
• Iterative list decoding of LDPC codes
  Tom Hholdt, Jrn Justesen
  Lecture Notes in Computer Science 4851, 2007, pp. 18-19
• Inverted Edwards coordinates
  Daniel J. Bernstein, Tanja Lange
  Lecture Notes in Computer Science 4851, 2007, pp. 20-27
• Spectra of Boolean functions, subspaces of matrices, and going up versus going down
  Gary McGuire
  Lecture Notes in Computer Science 4851, 2007, pp. 28-37
• Efficient list decoding of explicit codes with optimal redundancy
  Atri Rudra
  Lecture Notes in Computer Science 4851, 2007, pp. 38-46
• Algebraic structure theory of tail-biting trellises
  Priti Shankar
  Lecture Notes in Computer Science 4851, 2007, pp. 47-47
• Nice codes from nice curves
  Henning Stichtenoth
  Lecture Notes in Computer Science 4851, 2007, pp. 48-49
• Generalized Sudan's list decoding for order domain codes
  Olav Geil, Ryutaroh Matsumoto
  Lecture Notes in Computer Science 4851, 2007, pp. 50-59
• Bent functions and codes with low peak-to-average power ratio for multi-code CDMA
  Jianqin Zhou, Wai Ho Mow, Xiaoping Dai
  Lecture Notes in Computer Science 4851, 2007, pp. 60-71
• Determining the nonlinearity of a new family of APN functions
  Carl Bracken, Eimear Byrne, Nadya Markin, Gary McGuire
  Lecture Notes in Computer Science 4851, 2007, pp. 72-79
• An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths
  Koji Nuida, Satoshi Fujitsu, Manabu Hagiwara, Takashi Kitagawa, Hajime Watanabe, Kazuto Ogawa, Hideki Imai
  Lecture Notes in Computer Science 4851, 2007, pp. 80-89
• Space-time codes from crossed product algebras of degree 4
  Grégory Berhuy, Frédérique Oggier
  Lecture Notes in Computer Science 4851, 2007, pp. 90-99
• On non-randomness of the permutation after RC4 key scheduling
  Goutam Paul, Subhamoy Maitra, Rohit Srivastava
  Lecture Notes in Computer Science 4851, 2007, pp. 100-109
• Correctable errors of weight half the minimum distance plus one for the first-order Reed-Muller codes
  Kenji Yasunaga, Toru Fujiwara
  Lecture Notes in Computer Science 4851, 2007, pp. 110-119
• Fault-tolerant finite field computation in the public key cryptosystems
  Silvana Medos̑, Serdar Boztaş
  Lecture Notes in Computer Science 4851, 2007, pp. 120-129
• A note on a class of quadratic permutations over F_{2^n}
  Yann Laigle-Chapuy
  Lecture Notes in Computer Science 4851, 2007, pp. 130-137
• Constructions of orthonormal lattices and quaternion division algebras for totally real number fields
  B.A. Sethuraman, Frédérique Oggier
  Lecture Notes in Computer Science 4851, 2007, pp. 138-147
• Quaternary Plotkin constructions and quaternary Reed-Muller codes
  J. Pujol, J. Rifà, F.I. Solov'eva
  Lecture Notes in Computer Science 4851, 2007, pp. 148-157
• Joint source-cryptographic-channel coding based on linear block codes
  Haruhiko Kaneko, Eiji Fujiwara
  Lecture Notes in Computer Science 4851, 2007, pp. 158-167
• On the key-privacy issue of McEliece public-key encryption
  Shigenori Yamakawa, Yang Cui, Kazukuni Kobara, Manabu Hagiwara, Hideki Imai
  Lecture Notes in Computer Science 4851, 2007, pp. 168-177
• Lattices for distributed source coding: Jointly Gaussian sources and reconstruction of a linear function
  Dinesh Krithivasan, S. Sandeep Pradhan
  Lecture Notes in Computer Science 4851, 2007, pp. 178-187
• Linear complexity and autocorrelation of prime cube sequences
  Young-Joon Kim, Seok-Yong Jin, Hong-Yeop Song
  Lecture Notes in Computer Science 4851, 2007, pp. 188-197
• The ``art of trellis decoding'' is NP-hard
  Navin Kashyap
  Lecture Notes in Computer Science 4851, 2007, pp. 198-207
• On the structure of inversive pseudorandom number generators
  Harald Niederreiter, Arne Winterhof
  Lecture Notes in Computer Science 4851, 2007, pp. 208-216