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 22 matches
- 2004
- Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva:
The Classification of Some Perfect Codes. Des. Codes Cryptogr. 31(3): 313-318 (2004) - János Barát, Alberto Del Fra, Stefano Innamorati, Leo Storme:
Minimal Blocking Sets in PG(2, 8) and Maximal Partial Spreads in PG(3, 8). Des. Codes Cryptogr. 31(1): 15-26 (2004) - Ingrid Biehl, Sachar Paulus, Tsuyoshi Takagi:
Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders. Des. Codes Cryptogr. 31(2): 99-123 (2004) - Matthew R. Brown, Christine M. O'Keefe, Stanley E. Payne, Tim Penttila, Gordon F. Royle:
Spreads of T2(o), alpha-flocks and Ovals. Des. Codes Cryptogr. 31(3): 251-282 (2004) - Ulrich Dempwolff:
Affine Rank 3 Groups on Symmetric Designs. Des. Codes Cryptogr. 31(2): 159-168 (2004) - David A. Drake, Kevin Keating:
Ovals and Hyperovals in Desarguesian Nets. Des. Codes Cryptogr. 31(3): 195-212 (2004) - Yves Edel:
Extensions of Generalized Product Caps. Des. Codes Cryptogr. 31(1): 5-14 (2004) - David G. Glynn:
On the Orthogonality of Geometric Codes. Des. Codes Cryptogr. 31(1): 43-50 (2004) - Jovan Dj. Golic, Renato Menicocci:
Correlation Analysis of the Alternating Step Generator. Des. Codes Cryptogr. 31(1): 51-74 (2004) - T. Aaron Gulliver, Masaaki Harada:
On the Minimum Weight of Codes over F5 Constructed from Certain Conference Matrices. Des. Codes Cryptogr. 31(2): 139-145 (2004) - Andrew Klapper, Jinzhong Xu:
Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes. Des. Codes Cryptogr. 31(3): 227-250 (2004) - Andreas Klein:
Partial Ovoids in Classical Finite Polar Spaces. Des. Codes Cryptogr. 31(3): 221-226 (2004) - Klaus Metsch:
Small Point Sets that Meet All Generators of W(2n+1, iq). Des. Codes Cryptogr. 31(3): 283-288 (2004) - Siguna Müller:
On the Computation of Square Roots in Finite Fields. Des. Codes Cryptogr. 31(3): 301-312 (2004) - Michael E. O'Sullivan:
On Koetter's Algorithm and the Computation of Error Values. Des. Codes Cryptogr. 31(2): 169-188 (2004) - Sandro Rajola, Maria Scafati Tallini:
Affine Planes and Flag Linear Spaces. Des. Codes Cryptogr. 31(2): 133-137 (2004) - Gloria Rinaldi:
Key Distribution Patterns Using Tangent Circle Structures. Des. Codes Cryptogr. 31(3): 289-300 (2004) - Hans Georg Schaathun:
A Lower Bound on the Greedy Weights of Product Codes. Des. Codes Cryptogr. 31(1): 27-42 (2004) - Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth:
An Assmus-Mattson-Type Approach for Identifying 3-Designs from Linear Codes over Z4. Des. Codes Cryptogr. 31(1): 75-92 (2004) - Peter Sin:
The p-Rank of the Incidence Matrix of Intersecting Linear Subspaces. Des. Codes Cryptogr. 31(3): 213-220 (2004) - Pantelimon Stanica, Soo Hak Sung:
Boolean Functions with Five Controllable Cryptographic Properties. Des. Codes Cryptogr. 31(2): 147-157 (2004) - Tran van Trung, Sosina Martirosyan:
On a Class of Traceability Codes. Des. Codes Cryptogr. 31(2): 125-132 (2004)
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-26 06:12 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