default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17. AAECC 2007: Bangalore, India
- 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
Invited Contributions
- Venkatesan Guruswami:
List Decoding and Pseudorandom Constructions. 1-6 - Sondre Rønjom, Guang Gong, Tor Helleseth:
A Survey of Recent Attacks on the Filter Generator. 7-17 - Tom Høholdt, Jørn Justesen:
Iterative List Decoding of LDPC Codes. 18-19 - Daniel J. Bernstein, Tanja Lange:
Inverted Edwards Coordinates. 20-27 - Gary McGuire:
Spectra of Boolean Functions, Subspaces of Matrices, and Going Up Versus Going Down. 28-37 - Atri Rudra:
Efficient List Decoding of Explicit Codes with Optimal Redundancy. 38-46 - Priti Shankar:
Algebraic Structure Theory of Tail-Biting Trellises. 47 - Henning Stichtenoth:
Nice Codes from Nice Curves. 48-49
Regular Contributions
- Olav Geil, Ryutaroh Matsumoto:
Generalized Sudan's List Decoding for Order Domain Codes. 50-59 - Jianqin Zhou, Wai Ho Mow, Xiaoping Dai:
Bent Functions and Codes with Low Peak-to-Average Power Ratio for Multi-Code CDMA. 60-71 - Carl Bracken, Eimear Byrne, Nadya Markin, Gary McGuire:
Determining the Nonlinearity of a New Family of APN Functions. 72-79 - Koji Nuida
, Satoshi Fujitsu, Manabu Hagiwara, Takashi Kitagawa, Hajime Watanabe, Kazuto Ogawa, Hideki Imai:
An Improvement of Tardos's Collusion-Secure Fingerprinting Codes with Very Short Lengths. 80-89 - Grégory Berhuy, Frédérique E. Oggier:
Space-Time Codes from Crossed Product Algebras of Degree 4. 90-99 - Goutam Paul, Subhamoy Maitra, Rohit Srivastava:
On Non-randomness of the Permutation After RC4 Key Scheduling. 100-109 - Kenji Yasunaga, Toru Fujiwara:
Correctable Errors of Weight Half the Minimum Distance Plus One for the First-Order Reed-Muller Codes. 110-119 - Silvana Medos, Serdar Boztas:
Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems. 120-129 - Yann Laigle-Chapuy:
A Note on a Class of Quadratic Permutations over F2n. 130-137 - B. A. Sethuraman, Frédérique E. Oggier:
Constructions of Orthonormal Lattices and Quaternion Division Algebras for Totally Real Number Fields. 138-147 - Jaume Pujol, Josep Rifà, Faina I. Solov'eva:
Quaternary Plotkin Constructions and Quaternary Reed-Muller Codes. 148-157 - Haruhiko Kaneko, Eiji Fujiwara:
Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes. 158-167 - Shigenori Yamakawa, Yang Cui, Kazukuni Kobara, Manabu Hagiwara, Hideki Imai:
On the Key-Privacy Issue of McEliece Public-Key Encryption. 168-177 - Dinesh Krithivasan, S. Sandeep Pradhan:
Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function. 178-187 - Young-Joon Kim, Seok-Yong Jin, Hong-Yeop Song:
Linear Complexity and Autocorrelation of Prime Cube Sequences. 188-197 - Navin Kashyap:
The "Art of Trellis Decoding" Is NP-Hard. 198-207 - Harald Niederreiter, Arne Winterhof:
On the Structure of Inversive Pseudorandom Number Generators. 208-216 - Safitha J. Raj, Andrew Thangaraj:
Subcodes of Reed-Solomon Codes Suitable for Soft Decoding. 217-226 - Camilla Hollanti, Hsiao-feng Lu:
Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes. 227-236 - M. Prem Laxman Das, Kripasindhu Sikdar:
On the Computation of Non-uniform Input for List Decoding on Bezerra-Garcia Tower. 237-246 - Jyrki T. Lahtonen, Roope Vehkalahti:
Dense MIMO Matrix Lattices - A Meeting Point for Class Field Theory and Invariant Theory. 247-256 - Kazuki Yoneyama, Haruki Ota, Kazuo Ohta:
Secure Cross-Realm Client-to-Client Password-Based Authenticated Key Exchange Against Undetectable On-Line Dictionary Attacks. 257-266 - Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein:
Links Between Discriminating and Identifying Codes in the Binary Hamming Space. 267-270 - Sumanta Sarkar, Subhamoy Maitra:
Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity. 271-280 - P. Embury, Asha Rao:
A Path to Hadamard Matrices. 281-290 - Daniel J. Bernstein:
The Tangent FFT. 291-300 - Dang Hoai Bac, Nguyen Binh, Nguyen Xuan Quynh:
Novel Algebraic Structure for Cyclic Codes. 301-310 - Nimalsiri Pinnawala, Asha Rao, T. Aaron Gulliver:
Distribution of Trace Values and Two-Weight, Self-orthogonal Codes over GF ( p , 2). 311-320 - Selçuk Kavut, Melek D. Yücel:
Generalized Rotation Symmetric and Dihedral Symmetric Boolean Functions - 9 Variable Boolean Functions with Nonlinearity 242. 321-329 - Maheshanand, Siri Krishan Wasan:
On Quasi-cyclic Codes over Integer Residue Rings. 330-336 - Maria Bras-Amorós, Michael E. O'Sullivan:
Extended Norm-Trace Codes with Optimized Correction Capability. 337-346 - Heeralal Janwa, Arbind K. Lal:
On Generalized Hamming Weights and the Covering Radius of Linear Codes. 347-356 - Akihiro Yamamura:
Homomorphic Encryptions of Sums of Groups. 357-366
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
