Остановите войну!
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 51 matches
- 2011
- Tsonka Baicheva:
All binary linear codes of lengths up to 18 or redundancy up to 10 are normal. Adv. Math. Commun. 5(4): 681-686 (2011) - Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
The minimum order of complete caps in PG(4, 4). Adv. Math. Commun. 5(1): 37-40 (2011) - Anton Betten, Eun Ju Cheon, Seon Jeong Kim, Tatsuya Maruta:
The classification of (42, 6)8 arcs. Adv. Math. Commun. 5(2): 209-223 (2011) - Stefka Bouyuklieva, Anton Malevich, Wolfgang Willems:
On the performance of binary extremal self-dual codes. Adv. Math. Commun. 5(2): 267-274 (2011) - Stefka Bouyuklieva, Zlatko Varbanov:
Some connections between self-dual codes, combinatorial designs and secret sharing schemes. Adv. Math. Commun. 5(2): 191-198 (2011) - Michael Braun:
On lattices, binary codes, and network codes. Adv. Math. Commun. 5(2): 225-232 (2011) - Andries E. Brouwer, Tuvi Etzion:
Some new distance-4 constant weight codes. Adv. Math. Commun. 5(3): 417-424 (2011) - Csilla Bujtás, Zsolt Tuza:
Optimal batch codes: Many items or low retrieval requirement. Adv. Math. Commun. 5(3): 529-541 (2011) - Eimear Byrne:
On the weight distribution of codes over finite rings. Adv. Math. Commun. 5(2): 395-406 (2011) - Yeow Meng Chee, Xiande Zhang, Hui Zhang:
Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order. Adv. Math. Commun. 5(1): 59-68 (2011) - Irene Marquez Corbella, Edgar Martínez-Moro:
Algebraic structure of the minimal support codewords set of some linear codes. Adv. Math. Commun. 5(2): 233-244 (2011) - Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
Linear nonbinary covering codes and saturating sets in projective spaces. Adv. Math. Commun. 5(1): 119-147 (2011) - Steven T. Dougherty, Cristina Fernández-Córdoba:
Codes over ℤ2k, Gray map and self-dual codes. Adv. Math. Commun. 5(4): 571-588 (2011) - Konstantinos Drakakis:
On the degrees of freedom of Costas permutations and other constraints. Adv. Math. Commun. 5(3): 435-448 (2011) - Konstantinos Drakakis, Francesco Iorio, Scott Rickard:
The enumeration of Costas arrays of order 28 and its consequences. Adv. Math. Commun. 5(1): 69-86 (2011) - Konstantinos Drakakis, Francesco Iorio, Scott Rickard, John Walsh:
Results of the enumeration of Costas arrays of order 29. Adv. Math. Commun. 5(3): 547-553 (2011) - Philip N. J. Eagle, Steven D. Galbraith, John Ong:
Point compression for Koblitz elliptic curves. Adv. Math. Commun. 5(1): 1-10 (2011) - Stefan Erickson, Michael J. Jacobson Jr., Andreas Stein:
Explicit formulas for real hyperelliptic curves of genus 2 in affine representation. Adv. Math. Commun. 5(4): 623-666 (2011) - Tuvi Etzion, Alexander Vardy:
On q-analogs of Steiner systems and covering designs. Adv. Math. Commun. 5(2): 161-176 (2011) - Martianus Frederic Ezerman, San Ling, Patrick Solé, Olfa Yemen:
From skew-cyclic codes to asymmetric quantum codes. Adv. Math. Commun. 5(1): 41-57 (2011) - Thomas Feulner:
Canonization of linear codes over ℤ4. Adv. Math. Commun. 5(2): 245-266 (2011) - Harald Fripertinger:
The number of invariant subspaces under a linear operator on finite vector spaces. Adv. Math. Commun. 5(2): 407-416 (2011) - Olav Geil, Carlos Munuera, Diego Ruano, Fernando Torres:
On the order bounds for one-point AG codes. Adv. Math. Commun. 5(3): 489-504 (2011) - Dina Ghinelli, Jennifer D. Key:
Codes from incidence matrices and line graphs of Paley graphs. Adv. Math. Commun. 5(1): 93-108 (2011) - Idan Goldenberg, David Burshtein:
Error bounds for repeat-accumulate codes decoded via linear programming. Adv. Math. Commun. 5(4): 555-570 (2011) - Olof Heden, Martin Hessler:
On linear equivalence and Phelps codes. Addendum. Adv. Math. Commun. 5(3): 543-546 (2011) - Olof Heden, Denis S. Krotov:
On the structure of non-full-rank perfect q-ary codes. Adv. Math. Commun. 5(2): 149-156 (2011) - Thomas Honold, Ivan N. Landjev:
The dual construction for arcs in projective Hjelmslev spaces. Adv. Math. Commun. 5(1): 11-21 (2011) - Jennifer D. Key, Washiela Fish, Eric C. Mwambene:
Codes from the incidence matrices and line graphs of Hamming graphs Hk(n, 2) for k ≥ 2. Adv. Math. Commun. 5(2): 373-394 (2011) - Michael Kiermaier, Matthias Koch, Sascha Kurz:
2-arcs of maximal size in the affine and the projective Hjelmslev plane over ℤ25. Adv. Math. Commun. 5(2): 287-301 (2011)
skipping 21 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-25 17:16 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