default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 33 matches
- 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 - Robert J. McEliece, Edwin Soedarmadji:
On Generalized Parity Checks. AAECC 2006: 29-34 - Simon McNicol, Serdar Boztas, Asha Rao:
Traitor Tracing Against Powerful Attacks Using Combinatorial Designs. AAECC 2006: 215-224 - Miodrag J. Mihaljevic, Marc P. C. Fossorier, Hideki Imai:
A General Formulation of Algebraic and Fast Correlation Attacks Based on Dedicated Sample Decimation. AAECC 2006: 203-214 - Tatsuaki Okamoto:
Cryptography Based on Bilinear Maps. AAECC 2006: 35-50 - Kevin T. Phelps, Josep Rifà, Mercè Villanueva:
Hadamard Codes of Length 2ts (s Odd). Rank and Kernel. AAECC 2006: 328-337 - Florina Piroi, Arne Winterhof:
Quantum Period Reconstruction of Binary Sequences. AAECC 2006: 60-67 - Kalle Ranto, Petri Rosendahl:
The Solutions of the Third Power Sum Equation for Niho Type Decimations. AAECC 2006: 101-107 - Pradeep Kiran Sarvepalli, Andreas Klappenecker:
Nonbinary Quantum Codes from Hermitian Curves. AAECC 2006: 136-143 - Hans Georg Schaathun, Gérard D. Cohen:
Nested Codes for Constrained Memory and for Dirty Paper. AAECC 2006: 307-316 - Moshe Schwartz, Alexander Vardy:
New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems. AAECC 2006: 225-234 - Nobuyuki Sugio, Shunichi Nambu, Toshinobu Kaneko:
A Fast Calculus for the Linearizing Attack and Its Application to an Attack on KASUMI. AAECC 2006: 163-172 - 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. AAECC 2006: 265-274
skipping 3 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-16 09:22 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint