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 27 matches
- 2008
- T. L. Alderson, Keith E. Mellinger:
Geometric constructions of optimal optical orthogonal codes. Adv. Math. Commun. 2(4): 451-467 (2008) - Marcelo Muniz Silva Alves, Luciano Panek, Marcelo Firer:
Error-block codes and poset metrics. Adv. Math. Commun. 2(1): 95-111 (2008) - Bram van Asch, Frans Martens:
Lee weight enumerators of self-dual codes and theta functions. Adv. Math. Commun. 2(4): 393-402 (2008) - Alexander Barg, Arya Mazumdar, Gilles Zémor:
Weight distribution and decoding of codes on hypergraphs. Adv. Math. Commun. 2(4): 433-450 (2008) - Jan De Beule, Klaus Metsch, Leo Storme:
Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound. Adv. Math. Commun. 2(3): 261-272 (2008) - Delphine Boucher, Patrick Solé, Felix Ulmer:
Skew constacyclic codes over Galois rings. Adv. Math. Commun. 2(3): 273-292 (2008) - Maria Bras-Amorós, Michael E. O'Sullivan:
Duality for some families of correction capability optimized evaluation codes. Adv. Math. Commun. 2(1): 15-33 (2008) - Claude Carlet, Khoongming Khoo, Chu-Wee Lim, Chuan-Wen Loe:
On an improved correlation analysis of stream ciphers using multi-output Boolean functions and the related generalized notion of nonlinearity. Adv. Math. Commun. 2(2): 201-221 (2008) - Emmanuel Charbit, Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein:
Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity. Adv. Math. Commun. 2(4): 403-420 (2008) - Joan-Josep Climent, Francisco J. García, Verónica Requena:
On the construction of bent functions of n+2 variables from bent functions of n variables. Adv. Math. Commun. 2(4): 421-431 (2008) - Konstantinos Drakakis, Scott Rickard:
On the generalization of the Costas property in the continuum. Adv. Math. Commun. 2(2): 113-130 (2008) - Sergio Estrada, Juan Ramón García-Rozas, Justo Peralta, E. Sánchez-García:
Group convolutional codes. Adv. Math. Commun. 2(1): 83-94 (2008) - Felix Fontein:
Groups from cyclic infrastructures and Pohlig-Hellman in certain infrastructures. Adv. Math. Commun. 2(3): 293-307 (2008) - Ernst M. Gabidulin, Pierre Loidreau:
Properties of subspace subcodes of Gabidulin codes. Adv. Math. Commun. 2(2): 147-157 (2008) - Heide Gluesing-Luerssen, Fai-Lung Tsang:
A matrix ring description for cyclic convolutional codes. Adv. Math. Commun. 2(1): 55-81 (2008) - David Grant, Mahesh K. Varanasi:
Duality theory for space-time codes over finite fields. Adv. Math. Commun. 2(1): 35-54 (2008) - David Grant, Mahesh K. Varanasi:
The equivalence of space-time codes and codes defined over finite fields and Galois rings. Adv. Math. Commun. 2(2): 131-145 (2008) - Olof Heden:
A survey of perfect codes. Adv. Math. Commun. 2(2): 223-247 (2008) - Axel Heim, Vladimir Sidorenko, Uli Sorger:
Computation of distributions and their moments in the trellis. Adv. Math. Commun. 2(4): 373-391 (2008) - W. Cary Huffman:
Additive cyclic codes over F4. Adv. Math. Commun. 2(3): 309-343 (2008) - Alexei Kaltchenko, Nina Timofeeva:
Entropy estimators with almost sure convergence and an O(n-1) variance. Adv. Math. Commun. 2(1): 1-13 (2008) - Christine A. Kelley, Deepak Sridhara, Joachim Rosenthal:
Zig-zag and replacement product graphs and LDPC codes. Adv. Math. Commun. 2(4): 347-372 (2008) - Andreas Klein:
How to say yes, no and maybe with visual cryptography. Adv. Math. Commun. 2(3): 249-259 (2008) - John B. Little:
Erratum. Adv. Math. Commun. 2(3): 344-345 (2008) - Pradeep Kumar Mishra, Vassil S. Dimitrov:
A combinatorial interpretation of double base number system and some consequences. Adv. Math. Commun. 2(2): 159-173 (2008) - Carlos Munuera, Fernando Torres:
A note on the order bound on the minimum distance of AG codes and acute semigroups. Adv. Math. Commun. 2(2): 175-181 (2008) - Alexis De Vos, Yvan Van Rentergem:
Young subgroups for reversible computers. Adv. Math. Commun. 2(2): 183-200 (2008)
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-17 17:28 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