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 563 matches
- 2009
- Víctor Álvarez, José Andrés Armario, María Dolores Frau, Félix Gudiel, Amparo Osuna:
Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t. AAECC 2009: 204-214 - Rafael Álvarez, Leandro Tortosa, José-Francisco Vicent, Antonio Zamora:
A Non-abelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications. AAECC 2009: 117-126 - Riddhipratim Basu, Subhamoy Maitra, Goutam Paul, Tanmoy Talukdar:
On Some Sequences of the Secret Pseudo-random Index j in RC4 Key Scheduling. AAECC 2009: 137-148 - Peter Beelen, Diego Ruano:
The Order Bound for Toric Codes. AAECC 2009: 1-10 - José Joaquín Bernal, Ángel del Río, Juan Jacobo Simón:
There Are Not Non-obvious Cyclic Affine-invariant Codes. AAECC 2009: 101-106 - Jürgen Bierbrauer:
New Commutative Semifields and Their Nuclei. AAECC 2009: 179-185 - Mijail Borges-Quintana, Miguel A. Borges-Trenard, Edgar Martínez-Moro:
Gröbner Representations of Binary Matroids. AAECC 2009: 227-230 - Maria Bras-Amorós, Michael E. O'Sullivan:
From the Euclidean Algorithm for Solving a Key Equation for Dual Reed-Solomon Codes to the Berlekamp-Massey Algorithm. AAECC 2009: 32-42 - John Brevik, Michael E. O'Sullivan, Anya Umlauf, Richard Wolski:
Simulation of the Sum-Product Algorithm Using Stratified Sampling. AAECC 2009: 65-72 - Joan-Josep Climent, Victoria Herranz, Carmen Perea, Virtudes Tomás:
A Systems Theory Approach to Periodically Time-Varying Convolutional Codes by Means of Their Invariant Equivalent. AAECC 2009: 73-82 - Yang Cui, Kirill Morozov, Kazukuni Kobara, Hideki Imai:
Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE. AAECC 2009: 159-168 - José Ignacio Iglesias Curto:
On Elliptic Convolutional Goppa Codes. AAECC 2009: 83-91 - Iwan M. Duursma, Radoslav Kirov:
An Extension of the Order Bound for AG Codes. AAECC 2009: 11-22 - Edwin D. El-Mahassni, Domingo Gómez:
On the Distribution of Nonlinear Congruential Pseudorandom Numbers of Higher Orders in Residue Rings. AAECC 2009: 195-203 - Marta Giorgetti:
Interesting Examples on Maximal Irreducible Goppa Codes. AAECC 2009: 215-218 - Manabu Hagiwara, Takahiro Yoshida, Hideki Imai:
Bounds on the Number of Users for Random 2-Secure Codes. AAECC 2009: 239-242 - Tom Høholdt, Heeralal Janwa:
Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes. AAECC 2009: 53-64 - Álvar Ibeas, Arne Winterhof:
Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields. AAECC 2009: 169-178 - Ivan N. Landjev:
Spreads in Projective Hjelmslev Geometries. AAECC 2009: 186-194 - Sergio R. López-Permouth, Steve Szabo:
Repeated Root Cyclic and Negacyclic Codes over Galois Rings. AAECC 2009: 219-222 - David M. Monarres, Michael E. O'Sullivan:
A Generalization of the Zig-Zag Graph Product by Means of the Sandwich Product. AAECC 2009: 231-234 - Carlos Munuera, Fernando Torres, Juan Elmer Villanueva:
Sparse Numerical Semigroups. AAECC 2009: 23-31 - Kiyoshi Nagata, Fidel R. Nemenzo, Hideo Wada:
On Self-dual Codes over Z16. AAECC 2009: 107-116 - Hakan Özadam, Ferruh Özbudak:
The Minimum Hamming Distance of Cyclic Codes of Length 2ps. AAECC 2009: 92-100 - Jaume Pernas, Jaume Pujol, Mercè Villanueva:
Rank for Some Families of Quaternary Reed-Muller Codes. AAECC 2009: 43-52 - Jaume Pujol, Josep Rifà, Lorena Ronquillo:
Construction of Additive Reed-Muller Codes. AAECC 2009: 223-226 - SeongHan Shin, Kazukuni Kobara, Hideki Imai:
Very-Efficient Anonymous Password-Authenticated Key Exchange and Its Extensions. AAECC 2009: 149-158 - Guang Zeng, Yang Yang, Wenbao Han, Shuqin Fan:
Word Oriented Cascade Jump sigma-LFSR. AAECC 2009: 127-136 - Lei Zhang, Bo Qin, Qianhong Wu, Futai Zhang:
Novel Efficient Certificateless Aggregate Signatures. AAECC 2009: 235-238 - Maria Bras-Amorós, Tom Høholdt:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 18th International Symposium, AAECC-18 2009, Tarragona, Catalonia, Spain, June 8-12, 2009. Proceedings. Lecture Notes in Computer Science 5527, Springer 2009, ISBN 978-3-642-02180-0 [contents]
skipping 533 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-12-20 00:01 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