- Sondre Rønjom, Guang Gong, Tor Helleseth:
A Survey of Recent Attacks on the Filter Generator. AAECC 2007: 7-17 - Atri Rudra:
Efficient List Decoding of Explicit Codes with Optimal Redundancy. AAECC 2007: 38-46 - Sumanta Sarkar, Subhamoy Maitra:
Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity. AAECC 2007: 271-280 - B. A. Sethuraman, Frédérique E. Oggier:
Constructions of Orthonormal Lattices and Quaternion Division Algebras for Totally Real Number Fields. AAECC 2007: 138-147 - Priti Shankar:
Algebraic Structure Theory of Tail-Biting Trellises. AAECC 2007: 47 - Henning Stichtenoth:
Nice Codes from Nice Curves. AAECC 2007: 48-49 - Shigenori Yamakawa, Yang Cui, Kazukuni Kobara, Manabu Hagiwara, Hideki Imai:
On the Key-Privacy Issue of McEliece Public-Key Encryption. AAECC 2007: 168-177 - Akihiro Yamamura
:
Homomorphic Encryptions of Sums of Groups. AAECC 2007: 357-366 - Kenji Yasunaga, Toru Fujiwara:
Correctable Errors of Weight Half the Minimum Distance Plus One for the First-Order Reed-Muller Codes. AAECC 2007: 110-119 - Kazuki Yoneyama, Haruki Ota, Kazuo Ohta:
Secure Cross-Realm Client-to-Client Password-Based Authenticated Key Exchange Against Undetectable On-Line Dictionary Attacks. AAECC 2007: 257-266 - Jianqin Zhou, Wai Ho Mow, Xiaoping Dai:
Bent Functions and Codes with Low Peak-to-Average Power Ratio for Multi-Code CDMA. AAECC 2007: 60-71 - Serdar Boztas, Hsiao-feng Lu:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007, Proceedings. Lecture Notes in Computer Science 4851, Springer 2007, ISBN 978-3-540-77223-1 [contents] - 2006
- Shadi Abu-Surra, Gianluigi Liva, William E. Ryan:
Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping. AAECC 2006: 245-254 - Víctor Álvarez, José Andrés Armario, María Dolores Frau, Pedro Real:
A Genetic Algorithm for Cocyclic Hadamard Matrices. AAECC 2006: 144-153 - Mijail Borges-Quintana, Miguel A. Borges-Trenard, Edgar Martínez-Moro:
A General Framework for Applying FGLM Techniques to Linear Codes. AAECC 2006: 76-86 - Claude Carlet:
On Bent and Highly Nonlinear Balanced/Resilient Functions and Their Algebraic Immunities. AAECC 2006: 1-28 - Francis N. Castro, Ernesto Gomez, Oscar Moreno:
A Class of Fermat Curves for which Weil-Serre's Bound Can Be Improved. AAECC 2006: 128-135 - Chao-Yu Chen, Chung-Hsuan Wang, Chi-Chao Chao:
Complementary Sets and Reed-Muller Codes for Peak-to-Average Power Ratio Reduction in OFDM. AAECC 2006: 317-327 - Drue Coles:
On Constructing AG Codes Without Basis Functions for Riemann-Roch Spaces. AAECC 2006: 108-117 - Yang Cui, Kazukuni Kobara, Hideki Imai:
On Achieving Chosen Ciphertext Security with Decryption Errors. AAECC 2006: 173-182 - Jeffrey B. Farr, Shuhong Gao:
Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points. AAECC 2006: 118-127 - Olav Geil, Christian Thommesen:
On the Feng-Rao Bound for Generalized Hamming Weights. AAECC 2006: 295-306 - Manabu Hagiwara, Goichiro Hanaoka, Hideki Imai:
A Short Random Fingerprinting Code Against a Small Number of Pirates. AAECC 2006: 193-202 - Goichiro Hanaoka, Yumiko Hanaoka, Manabu Hagiwara, Hajime Watanabe, Hideki Imai:
Unconditionally Secure Chaffing-and-Winnowing: A Relationship Between Encryption and Authentication. AAECC 2006: 154-162 - Tom Høholdt:
The Merit Factor Problem for Binary Sequences. AAECC 2006: 51-59 - Kathy J. Horadam:
A Theory of Highly Nonlinear Functions. AAECC 2006: 87-100 - Xiaowei Jin, Teng Li, Thomas E. Fuja, Oliver M. Collins:
LDPC Codes for Fading Channels: Two Strategies. AAECC 2006: 235-244 - Tali Kaufman, Simon Litsyn:
Long Extended BCH Codes Are Spanned by Minimum Weight Words. AAECC 2006: 285-294 - 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. AAECC 2006: 275-284 - 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. AAECC 2006: 255-264
