16. AAECC 2006: Las Vegas, NV, USA

• Claude Carlet:
  On Bent and Highly Nonlinear Balanced/Resilient Functions and Their Algebraic Immunities. 1-28
  
• Robert J. McEliece, Edwin Soedarmadji:
  On Generalized Parity Checks. 29-34
  
• Tatsuaki Okamoto:
  Cryptography Based on Bilinear Maps. 35-50
  
• Tom Høholdt:
  The Merit Factor Problem for Binary Sequences. 51-59
  
• Florina Piroi, Arne Winterhof:
  Quantum Period Reconstruction of Binary Sequences. 60-67
  
• Li-Ping Wang:
  The Vector Key Equation and Multisequence Shift Register Synthesis. 68-75
  
• Mijail Borges-Quintana, Miguel A. Borges-Trenard, Edgar Martínez-Moro:
  A General Framework for Applying FGLM Techniques to Linear Codes. 76-86
  
• Kathy J. Horadam:
  A Theory of Highly Nonlinear Functions. 87-100
  
• Kalle Ranto, Petri Rosendahl:
  The Solutions of the Third Power Sum Equation for Niho Type Decimations. 101-107
  
• Drue Coles:
  On Constructing AG Codes Without Basis Functions for Riemann-Roch Spaces. 108-117
  
• Jeffrey B. Farr, Shuhong Gao:
  Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points. 118-127
  
• Francis N. Castro, Ernesto Gomez, Oscar Moreno:
  A Class of Fermat Curves for which Weil-Serre's Bound Can Be Improved. 128-135
  
• Pradeep Kiran Sarvepalli, Andreas Klappenecker:
  Nonbinary Quantum Codes from Hermitian Curves. 136-143
  
• V. Álvarez, J. A. Armario, M. D. Frau, P. Real:
  A Genetic Algorithm for Cocyclic Hadamard Matrices. 144-153
  
• Goichiro Hanaoka, Yumiko Hanaoka, Manabu Hagiwara, Hajime Watanabe, Hideki Imai:
  Unconditionally Secure Chaffing-and-Winnowing: A Relationship Between Encryption and Authentication. 154-162
  
• Nobuyuki Sugio, Shunichi Nambu, Toshinobu Kaneko:
  A Fast Calculus for the Linearizing Attack and Its Application to an Attack on KASUMI. 163-172
  
• Yang Cui, Kazukuni Kobara, Hideki Imai:
  On Achieving Chosen Ciphertext Security with Decryption Errors. 173-182
  
• Peng Yang, Takashi Kitagawa, Goichiro Hanaoka, Rui Zhang, Kanta Matsuura, Hideki Imai:
  Applying Fujisaki-Okamoto to Identity-Based Encryption. 183-192
  
• Manabu Hagiwara, Goichiro Hanaoka, Hideki Imai:
  A Short Random Fingerprinting Code Against a Small Number of Pirates. 193-202
  
• Miodrag J. Mihaljevic, Marc P. C. Fossorier, Hideki Imai:
  A General Formulation of Algebraic and Fast Correlation Attacks Based on Dedicated Sample Decimation. 203-214
  
• Simon McNicol, Serdar Boztas, Asha Rao:
  Traitor Tracing Against Powerful Attacks Using Combinatorial Designs. 215-224
  
• Moshe Schwartz, Alexander Vardy:
  New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems. 225-234
  
• Xiaowei Jin, Teng Li, Thomas E. Fuja, Oliver M. Collins:
  LDPC Codes for Fading Channels: Two Strategies. 235-244
  
• Shadi Abu-Surra, Gianluigi Liva, William E. Ryan:
  Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping. 245-254
  
• Lan Lan, Lingqi Zeng, Ying Yu Tai, Lei Chen, Shu Lin, Khaled A. S. Abdel-Ghaffar:
  Algebraic Constructions of Quasi-cyclic LDPC Codes - Part I: For AWGN and Binary Random Erasure Channels. 255-264
  
• Ying Yu Tai, Lingqi Zeng, Lan Lan, Shumei Song, Shu Lin, Khaled A. S. Abdel-Ghaffar:
  Algebraic Construction of Quasi-cyclic LDPC Codes - Part II: For AWGN and Binary Random and Burst Erasure Channels. 265-274
  
• Lan Lan, Ying Yu Tai, Shu Lin, Behshad Memari, Bahram Honary:
  New Constructions of Quasi-cyclic LDPC Codes Based on Two Classes of Balanced Incomplete Block Designs: For AWGN and Binary Erasure Channels. 275-284
  
• Tali Kaufman, Simon Litsyn:
  Long Extended BCH Codes Are Spanned by Minimum Weight Words. 285-294
  
• Olav Geil, Christian Thommesen:
  On the Feng-Rao Bound for Generalized Hamming Weights. 295-306
  
• Hans Georg Schaathun, Gérard D. Cohen:
  Nested Codes for Constrained Memory and for Dirty Paper. 307-316
  
• Chao-Yu Chen, Chung-Hsuan Wang, Chi-Chao Chao:
  Complementary Sets and Reed-Muller Codes for Peak-to-Average Power Ratio Reduction in OFDM. 317-327
  
• Kevin T. Phelps, Josep Rifà, Mercè Villanueva:
  Hadamard Codes of Length 2^ts (s Odd). Rank and Kernel. 328-337