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 34 matches
- 2007
- Rudolf Ahlswede:
The final form of Tao's inequality relating conditional expectation and conditional mutual information. Adv. Math. Commun. 1(2): 239-242 (2007) - Robert F. Bailey, John Bray:
Decoding the Mathieu group M12. Adv. Math. Commun. 1(4): 477-487 (2007) - Alexander Barg, Oleg R. Musin:
Codes in spherical caps. Adv. Math. Commun. 1(1): 131-149 (2007) - Evangeline P. Bautista, Philippe Gaborit, Jon-Lark Kim, Judy L. Walker:
s-extremal additive F4 codes. Adv. Math. Commun. 1(1): 111-130 (2007) - Yael Ben-Haim, Simon Litsyn:
A new upper bound on the rate of non-binary codes. Adv. Math. Commun. 1(1): 83-92 (2007) - Joan-Josep Climent, Elisa Gorla, Joachim Rosenthal:
Cryptanalysis of the CFVZ cryptosystem. Adv. Math. Commun. 1(1): 1-11 (2007) - Gérard D. Cohen, Alexander Vardy:
Duality between packings and coverings of the Hamming space. Adv. Math. Commun. 1(1): 93-97 (2007) - John H. Conway, Neil J. A. Sloane:
The optimal isodual lattice quantizer in three dimensions. Adv. Math. Commun. 1(2): 257-260 (2007) - Isabelle Déchène:
On the security of generalized Jacobian cryptosystems. Adv. Math. Commun. 1(4): 413-426 (2007) - Denis Dmitriev, Jonathan Jedwab:
Bounds on the growth rate of the peak sidelobe level of binary sequences. Adv. Math. Commun. 1(4): 461-475 (2007) - Steven T. Dougherty, Jon-Lark Kim, Patrick Solé:
Double circulant codes from two class association schemes. Adv. Math. Commun. 1(1): 45-64 (2007) - Konstantinos Drakakis, Rod Gow, Scott Rickard:
Parity properties of Costas arrays defined via finite fields. Adv. Math. Commun. 1(3): 321-330 (2007) - Jonas Eriksson:
A weight-based characterization of the set of correctable error patterns under list-of-2 decoding. Adv. Math. Commun. 1(3): 331-356 (2007) - Marcus Greferath:
Editorial. Adv. Math. Commun. 1(1) (2007) - T. Aaron Gulliver, Masaaki Harada, Hiroki Miyabayashi:
Double circulant and quasi-twisted self-dual codes over F5 and F7. Adv. Math. Commun. 1(2): 223-238 (2007) - Masaaki Harada, Akihiro Munemasa:
On the covering radii of extremal doubly even self-dual codes. Adv. Math. Commun. 1(2): 251-256 (2007) - Masaaki Harada, Takuji Nishimura:
An extremal singly even self-dual code of length 88. Adv. Math. Commun. 1(2): 261-267 (2007) - Olof Heden:
The partial order of perfect codes associated to a perfect code. Adv. Math. Commun. 1(4): 399-412 (2007) - W. Cary Huffman:
Additive self-dual codes over F4 with an automorphism of odd prime order. Adv. Math. Commun. 1(3): 357-398 (2007) - W. Cary Huffman:
Additive cyclic codes over F4. Adv. Math. Commun. 1(4): 427-459 (2007) - Michael J. Jacobson Jr., Renate Scheidler, Andreas Stein:
Cryptographic protocols on real hyperelliptic curves. Adv. Math. Commun. 1(2): 197-221 (2007) - Christine A. Kelley, Deepak Sridhara:
Eigenvalue bounds on the pseudocodeword weight of expander codes. Adv. Math. Commun. 1(3): 287-306 (2007) - Andrew Klapper:
The asymptotic behavior of N-adic complexity. Adv. Math. Commun. 1(3): 307-319 (2007) - Neal Koblitz, Alfred Menezes:
Another look at generic groups. Adv. Math. Commun. 1(1): 13-28 (2007) - Jyrki T. Lahtonen, Gary McGuire, Harold N. Ward:
Gold and Kasami-Welch functions, quadratic forms, and bent functions. Adv. Math. Commun. 1(2): 243-250 (2007) - Ivan N. Landjev:
On blocking sets in projective Hjelmslev planes. Adv. Math. Commun. 1(1): 65-81 (2007) - John B. Little:
The ubiquity of order domains for the construction of error control codes. Adv. Math. Commun. 1(1): 151-171 (2007) - David Lubicz:
On a classification of finite statistical tests. Adv. Math. Commun. 1(4): 509-524 (2007) - Florian Luca, Igor E. Shparlinski:
On finite fields for pairing based cryptography. Adv. Math. Commun. 1(3): 281-286 (2007) - Gérard Maze, Chris Monico, Joachim Rosenthal:
Public key cryptography based on semigroup actions. Adv. Math. Commun. 1(4): 489-507 (2007)
skipping 4 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-12-01 10:47 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