Остановите войну!
for scientists:
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
- 2011
- Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger:
Redundant τ-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication. Des. Codes Cryptogr. 58(2): 173-202 (2011) - Koichi Betsumiya, Masaaki Harada, Hiroshi Kimura:
Hadamard matrices of order 32 and extremal ternary self-dual codes. Des. Codes Cryptogr. 58(2): 203-214 (2011) - Marco Buratti, Koji Momihara, Anita Pasotti:
New results on optimal (v, 4, 2, 1) optical orthogonal codes. Des. Codes Cryptogr. 58(1): 89-109 (2011) - Padraig Ó Catháin, Marc Röder:
The cocyclic Hadamard matrices of order less than 40. Des. Codes Cryptogr. 58(1): 73-88 (2011) - Jie Cui, Junying Pei:
Quaternary 1-generator quasi-cyclic codes. Des. Codes Cryptogr. 58(1): 23-33 (2011) - Sudhir R. Ghorpade, Sartaj Ul Hasan, Meena Kumari:
Primitive polynomials, singer cycles and word-oriented linear feedback shift registers. Des. Codes Cryptogr. 58(2): 123-134 (2011) - David G. Glynn:
An invariant for matrices and sets of points in prime characteristic. Des. Codes Cryptogr. 58(2): 155-172 (2011) - David G. Glynn:
A condition for arcs and MDS codes. Des. Codes Cryptogr. 58(2): 215-218 (2011) - Kwangsu Lee, Dong Hoon Lee:
Improved hidden vector encryption with short ciphertexts and tokens. Des. Codes Cryptogr. 58(3): 297-319 (2011) - Jianguo Lei, Cuiling Fan:
Optimal difference systems of sets and partition-type cyclic difference packings. Des. Codes Cryptogr. 58(2): 135-153 (2011) - Yongqiang Li, Mingsheng Wang:
On EA-equivalence of certain permutations to power mappings. Des. Codes Cryptogr. 58(3): 259-269 (2011) - Xiaoyu Liu:
An equivalence of Ward's bound and its application. Des. Codes Cryptogr. 58(1): 1-9 (2011) - Jong Hwan Park:
Inner-product encryption under standard assumptions. Des. Codes Cryptogr. 58(3): 235-257 (2011) - Rajendra M. Pawale:
Quasi-symmetric designs with the difference of block intersection numbers two. Des. Codes Cryptogr. 58(2): 111-121 (2011) - Dimitrios Poulakis:
Erratum to: A variant of Digital Signature Algorithm. Des. Codes Cryptogr. 58(2): 219 (2011) - Palash Sarkar:
A trade-off between collision probability and key size in universal hashing using polynomials. Des. Codes Cryptogr. 58(3): 271-278 (2011) - Tamir Tassa:
Generalized oblivious transfer by secret sharing. Des. Codes Cryptogr. 58(1): 11-21 (2011) - Bahattin Yildiz, Suat Karadeniz:
Cyclic codes over F2+uF2+vF2+uvF2. Des. Codes Cryptogr. 58(3): 221-234 (2011) - Aaram Yun, Je Hong Park, Jooyoung Lee:
On Lai-Massey and quasi-Feistel ciphers. Des. Codes Cryptogr. 58(1): 45-72 (2011) - Hui Zhang, Gennian Ge:
Completely reducible super-simple designs with block size four and related super-simple packings. Des. Codes Cryptogr. 58(3): 321-346 (2011) - Changan Zhao, Dongqing Xie, Fangguo Zhang, Jingwei Zhang, Binglong Chen:
Computing bilinear pairings on elliptic curves with automorphisms. Des. Codes Cryptogr. 58(1): 35-44 (2011) - Jianqin Zhou:
On the k-error linear complexity of sequences with period 2pn over GF(q). Des. Codes Cryptogr. 58(3): 279-296 (2011)
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-06-08 20:39 CEST 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