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 37 matches
- 2017
- Angela Aguglia, Luca Giuzzi:
Intersection sets, three-character multisets and associated codes. Des. Codes Cryptogr. 83(2): 269-282 (2017) - Jaehyun Ahn, Dongseok Ka, Chengju Li:
Complete weight enumerators of a class of linear codes. Des. Codes Cryptogr. 83(1): 83-99 (2017) - Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco:
On the completeness of plane cubic curves over finite fields. Des. Codes Cryptogr. 83(2): 233-267 (2017) - Sergey Bereg, Linda Morales, Ivan Hal Sudborough:
Extending permutation arrays: improving MOLS bounds. Des. Codes Cryptogr. 83(3): 661-683 (2017) - Bocong Chen, Liren Lin, San Ling, Hongwei Liu:
Three new classes of optimal frequency-hopping sequence sets. Des. Codes Cryptogr. 83(1): 219-232 (2017) - Xiaotian Chen, Yue Zhou:
Asynchronous channel hopping systems from difference sets. Des. Codes Cryptogr. 83(1): 179-196 (2017) - Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao:
Codes with the identifiable parent property for multimedia fingerprinting. Des. Codes Cryptogr. 83(1): 71-82 (2017) - Aras Erzurumluoglu, David A. Pike:
Twofold triple systems without 2-intersecting Gray codes. Des. Codes Cryptogr. 83(3): 611-631 (2017) - Xinxin Fan, Adilet Otemissov, Francesco Sica, Andrey Sidorenko:
Multiple point compression on elliptic curves. Des. Codes Cryptogr. 83(3): 565-588 (2017) - Elisa Gorla, Maike Massierer:
An optimal representation for the trace zero subgroup. Des. Codes Cryptogr. 83(3): 519-548 (2017) - Victor J. W. Guo, Yiting Yang:
Proof of a conjecture of Kløve on permutation codes under the Chebychev distance. Des. Codes Cryptogr. 83(3): 685-690 (2017) - Yonglin Hao, Willi Meier:
Truncated differential based known-key attacks on round-reduced SIMON. Des. Codes Cryptogr. 83(2): 467-492 (2017) - Ziling Heng, Qin Yue:
Evaluation of the Hamming weights of a class of linear codes based on Gauss sums. Des. Codes Cryptogr. 83(2): 307-326 (2017) - Yupeng Jiang, Jiangshuai Yang:
On the number of irreducible linear transformation shift registers. Des. Codes Cryptogr. 83(2): 445-454 (2017) - Lingfei Jin, Haibin Kan:
Construction of binary linear codes via rational function fields. Des. Codes Cryptogr. 83(3): 633-638 (2017) - Jon-Lark Kim, Nari Lee:
A projection decoding of a binary extremal self-dual code of length 40. Des. Codes Cryptogr. 83(3): 589-609 (2017) - Denis S. Krotov:
On the automorphism groups of the Z2 Z4 -linear 1-perfect and Preparata-like codes. Des. Codes Cryptogr. 83(1): 169-177 (2017) - Margreta Kuijper, Raquel Pinto:
An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings. Des. Codes Cryptogr. 83(2): 283-305 (2017) - Esteban Landerreche, David Fernández-Duque:
A case study in almost-perfect security for unconditionally secure communication. Des. Codes Cryptogr. 83(1): 145-168 (2017) - Xiao-Nan Lu, Masakazu Jimbo:
Affine-invariant strictly cyclic Steiner quadruple systems. Des. Codes Cryptogr. 83(1): 33-69 (2017) - Yiyuan Luo, Xuejia Lai, Yujie Zhou:
Generic attacks on the Lai-Massey scheme. Des. Codes Cryptogr. 83(2): 407-423 (2017) - Jingxue Ma, Tao Zhang, Tao Feng, Gennian Ge:
Some new results on permutation polynomials over finite fields. Des. Codes Cryptogr. 83(2): 425-443 (2017) - Umberto Martínez-Peñas:
On the roots and minimum rank distance of skew cyclic codes. Des. Codes Cryptogr. 83(3): 639-660 (2017) - Bart Mennink:
Optimal collision security in double block length hashing with single length key. Des. Codes Cryptogr. 83(2): 357-406 (2017) - Diego Napp, Raquel Pinto, Marisa Toste:
On MDS convolutional codes over Zpr. Des. Codes Cryptogr. 83(1): 101-114 (2017) - Esmeralda Nastase, Papa A. Sissokho:
The structure of the minimum size supertail of a subspace partition. Des. Codes Cryptogr. 83(3): 549-563 (2017) - Nicola Pace, Angelo Sonnino:
On linear codes admitting large automorphism groups. Des. Codes Cryptogr. 83(1): 115-143 (2017) - Liqiang Peng, Lei Hu, Yao Lu, Jun Xu, Zhangjie Huang:
Cryptanalysis of Dual RSA. Des. Codes Cryptogr. 83(1): 1-21 (2017) - Ignacio F. Rúa:
Primitive semifields of order 24e. Des. Codes Cryptogr. 83(2): 345-356 (2017) - Mahdi Sajadieh, Arash Mirzaei, Hamid Mala, Vincent Rijmen:
A new counting method to bound the number of active S-boxes in Rijndael and 3D. Des. Codes Cryptogr. 83(2): 327-343 (2017)
skipping 7 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-11-18 13:25 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