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 28 matches
- 2004
- Simeon Ball, John Bamberg, Michel Lavrauw, Tim Penttila:
Symplectic Spreads. Des. Codes Cryptogr. 32(1-3): 9-14 (2004) - Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Massimiliano Listo:
Design of Self-Healing Key Distribution Schemes. Des. Codes Cryptogr. 32(1-3): 15-44 (2004) - Julia M. N. Brown:
On the Action of the Groups GL(n+1, q), PGL(n+1, q), SL(n+1, q) and PSL(n+1, q) on PG(n, qt). Des. Codes Cryptogr. 32(1-3): 45-50 (2004) - Wensong Chu, Charles J. Colbourn, Peter Dukes:
Constructions for Permutation Codes in Powerline Communications. Des. Codes Cryptogr. 32(1-3): 51-64 (2004) - Frank De Clerck, Mario Delanote:
On (0, alpha)-Geometries and Dual Semipartial Geometries Fully Embedded in an Affine Space. Des. Codes Cryptogr. 32(1-3): 103-110 (2004) - Charles J. Colbourn, Alan C. H. Ling, Violet R. Syrotiuk:
Cover-Free Families and Topology-Transparent Scheduling for MANETs. Des. Codes Cryptogr. 32(1-3): 65-95 (2004) - Antonio Cossidente, Marialuisa J. de Resmini:
Remarks on Singer Cyclic Groups and Their Normalizers. Des. Codes Cryptogr. 32(1-3): 97-102 (2004) - D. Deng, Douglas R. Stinson, Ruizhong Wei:
The Lovász Local Lemma and Its Applications to some Combinatorial Arrays. Des. Codes Cryptogr. 32(1-3): 121-134 (2004) - David A. Drake, Wendy J. Myrvold:
Nets of Small Degree Without Ovals. Des. Codes Cryptogr. 32(1-3): 167-183 (2004) - Ziba Eslami, Gholamreza B. Khosrovshahi, Morteza Mohammad Noori:
Enumeration of t-Designs Through Intersection Matrices. Des. Codes Cryptogr. 32(1-3): 185-191 (2004) - Nikias de Feyter:
Planar Oval Sets in Desarguesian Planes of Even Order. Des. Codes Cryptogr. 32(1-3): 111-119 (2004) - Stelios Georgiou, Christos Koukouvinos:
Self-Orthogonal and Self-Dual Codes Constructed via Combinatorial Designs and Diophantine Equations. Des. Codes Cryptogr. 32(1-3): 193-206 (2004) - Otokar Grosek, Peter Horák, Tran van Trung:
On Non-Polynomial Latin Squares. Des. Codes Cryptogr. 32(1-3): 217-226 (2004) - Yury J. Ionin:
Regular Hadamard Matrices Generating Infinite Families of Symmetric Designs. Des. Codes Cryptogr. 32(1-3): 227-233 (2004) - Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie:
Some Indecomposable t-Designs. Des. Codes Cryptogr. 32(1-3): 235-238 (2004) - Gábor Korchmáros, Angelo Sonnino:
Hyperbolic Ovals in Finite Planes. Des. Codes Cryptogr. 32(1-3): 239-249 (2004) - Selda Küçükçifçi, Charles C. Lindner:
Minimum Covering for Hexagon Triple Systems. Des. Codes Cryptogr. 32(1-3): 251-265 (2004) - Domenico Labbate:
Amalgams of Cubic Bipartite Graphs. Des. Codes Cryptogr. 32(1-3): 267-275 (2004) - Reinhard Laue:
Resolvable t-Designs. Des. Codes Cryptogr. 32(1-3): 277-301 (2004) - X. Ma, Ruizhong Wei:
On a Bound of Cover-Free Families. Des. Codes Cryptogr. 32(1-3): 303-321 (2004) - Sosina Martirosyan, Tran van Trung:
On t-Covering Arrays. Des. Codes Cryptogr. 32(1-3): 323-339 (2004) - Keith E. Mellinger:
LDPC Codes from Triangle-Free Line Sets. Des. Codes Cryptogr. 32(1-3): 341-350 (2004) - Alan Offer, Hendrik Van Maldeghem:
Spreads and Ovoids Translation with Respect to Disjoint Flags. Des. Codes Cryptogr. 32(1-3): 351-367 (2004) - Alfredo De Santis, Barbara Masucci:
Anonymous Membership Broadcast Schemes. Des. Codes Cryptogr. 32(1-3): 135-151 (2004) - Tanya E. Seidel, Daniel Socek, Michal Sramka:
Parallel Symmetric Attack on NTRU using Non-Deterministic Lattice Reduction. Des. Codes Cryptogr. 32(1-3): 369-379 (2004) - Ron Shaw, Neil A. Gordon:
The Quintic Grassmannian G{1, 4, 2} in PG(9, 2). Des. Codes Cryptogr. 32(1-3): 381-396 (2004) - María Isabel González Vasco, Dennis Hofheinz, Consuelo Martínez, Rainer Steinwandt:
On the Security of Two Public Key Cryptosystems Using Non-Abelian Groups. Des. Codes Cryptogr. 32(1-3): 207-216 (2004) - Stefaan De Winter, Joseph A. Thas:
SPG-Reguli Satisfying the Polar Property and a New Semipartial Geometry. Des. Codes Cryptogr. 32(1-3): 153-166 (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-01 09:46 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