Остановите войну!
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 65 matches
- 2014
- Avishek Adhikari:
Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images. Des. Codes Cryptogr. 73(3): 865-895 (2014) - Sarah E. Anderson, Gretchen L. Matthews:
Exponents of polar codes using algebraic geometric code kernels. Des. Codes Cryptogr. 73(2): 699-717 (2014) - Stéphane Ballet, Robert Rolland:
On low weight codewords of generalized affine and projective Reed-Muller codes. Des. Codes Cryptogr. 73(2): 271-297 (2014) - Edoardo Ballico:
Any network code comes from an algebraic curve taking osculating spaces. Des. Codes Cryptogr. 73(3): 1023-1026 (2014) - Céline Blondeau, Léo Perrin:
More differentially 6-uniform power functions. Des. Codes Cryptogr. 73(2): 487-505 (2014) - Wayne Broughton:
Admissible parameters of symmetric designs satisfying $$v=4(k-\lambda )+2$$ and symmetric designs with inner balance. Des. Codes Cryptogr. 73(1): 77-83 (2014) - Lilya Budaghyan, Tor Helleseth, Matthew Geoffrey Parker:
Editorial: special issue on coding and cryptography. Des. Codes Cryptogr. 73(2): 269 (2014) - Stanislav Bulygin, Michael Walter, Johannes Buchmann:
Full analysis of PRINTcipher with respect to invariant subspace attack: efficient key recovery and countermeasures. Des. Codes Cryptogr. 73(3): 997-1022 (2014) - Weiwei Cao, Lei Hu:
Projective interpolation of polynomial vectors and improved key recovery attack on SFLASH. Des. Codes Cryptogr. 73(3): 719-730 (2014) - Claude Carlet, Andrew Klapper:
On the arithmetic Walsh coefficients of Boolean functions. Des. Codes Cryptogr. 73(2): 299-318 (2014) - Florian Caullery:
A new large class of functions not APN infinitely often. Des. Codes Cryptogr. 73(2): 601-614 (2014) - Jie Chen, Hoon Wei Lim, San Ling, Le Su, Huaxiong Wang:
Spatial encryption supporting non-monotone access structure. Des. Codes Cryptogr. 73(3): 731-746 (2014) - Jie Chen, Hoon Wei Lim, San Ling, Huaxiong Wang, Hoeteck Wee:
Shorter identity-based encryption via asymmetric pairings. Des. Codes Cryptogr. 73(3): 911-947 (2014) - Naoki Chigira, Masaaki Harada, Masaaki Kitazume:
On the classification of extremal doubly even self-dual codes with 2-transitive automorphism groups. Des. Codes Cryptogr. 73(1): 33-35 (2014) - Antonio Cossidente, Francesco Pavese:
New infinite families of hyperovals on $$\mathcal H (3, q2), q$$ H ( 3 , q 2 ) , q odd. Des. Codes Cryptogr. 73(1): 217-222 (2014) - Alain Couvreur, Philippe Gaborit, Valérie Gauthier-Umaña, Ayoub Otmani, Jean-Pierre Tillich:
Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes. Des. Codes Cryptogr. 73(2): 641-666 (2014) - Steven T. Dougherty, Esengül Saltürk:
Counting codes over rings. Des. Codes Cryptogr. 73(1): 151-165 (2014) - Elena Dubrova:
Generation of full cycles by a composition of NLFSRs. Des. Codes Cryptogr. 73(2): 469-486 (2014) - Jianying Fang, Yanxun Chang:
Mutually disjoint t-designs and t-SEEDs from extremal doubly-even self-dual codes. Des. Codes Cryptogr. 73(3): 769-780 (2014) - Jianying Fang, Junling Zhou, Yanxun Chang:
Nonexistence of some quantum jump codes with specified parameters. Des. Codes Cryptogr. 73(1): 223-235 (2014) - Tao Feng, Sihuang Hu, Shuxing Li, Gennian Ge:
Difference sets with few character values. Des. Codes Cryptogr. 73(3): 825-839 (2014) - Felix Fontein, Michael Schneider, Urs Wagner:
PotLLL: a polynomial time version of LLL with deep insertions. Des. Codes Cryptogr. 73(2): 355-368 (2014) - Alexander L. Gavrilyuk, Ivan Yu. Mogilnykh:
Cameron-Liebler line classes in PG(n, 4). Des. Codes Cryptogr. 73(3): 969-982 (2014) - Olav Geil:
Erratum to: On the second weight of generalized Reed-Muller codes. Des. Codes Cryptogr. 73(1): 267 (2014) - Bogdan Groza, Bogdan Warinschi:
Cryptographic puzzles and DoS resilience, revisited. Des. Codes Cryptogr. 73(1): 177-207 (2014) - Javier Herranz, Alexandre Ruiz, Germán Sáez:
New results and applications for multi-secret sharing schemes. Des. Codes Cryptogr. 73(3): 841-864 (2014) - Naoyuki Horiguchi, Tsuyoshi Miezaki, Hiroyuki Nakasora:
Erratum to: On the support designs of extremal binary doubly even self-dual codes. Des. Codes Cryptogr. 73(3): 1027-1028 (2014) - Jialin Huang, Xuejia Lai:
Revisiting key schedule's diffusion in relation with round function's diffusion. Des. Codes Cryptogr. 73(1): 85-103 (2014) - Mahabir Prasad Jhanwar, Ayineedi Venkateswarlu, Reihaneh Safavi-Naini:
Paillier-based publicly verifiable (non-interactive) secret sharing. Des. Codes Cryptogr. 73(2): 529-546 (2014) - Hyun Kwang Kim, Phan Thanh Toan:
New inequalities for $$q$$ q -ary constant-weight codes. Des. Codes Cryptogr. 73(2): 369-381 (2014)
skipping 35 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-05-13 08:38 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