Остановите войну!
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 48 matches
- 2018
- Gora Adj, Isaac Canales-Martínez, Nareli Cruz Cortés, Alfred Menezes, Thomaz Oliveira, Luis Rivera-Zamarripa, Francisco Rodríguez-Henríquez:
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields. Adv. Math. Commun. 12(4): 741-759 (2018) - Adel Alahmadi, Cem Güneri, Hatoon Shohaib, Patrick Solé:
Long quasi-polycyclic t-CIS codes. Adv. Math. Commun. 12(1): 189-198 (2018) - Nazar Arakelian, Saeed Tafazolian, Fernando Torres:
On the spectrum for the genera of maximal curves over small fields. Adv. Math. Commun. 12(1): 143-149 (2018) - Jingjun Bao:
New families of strictly optimal frequency hopping sequence sets. Adv. Math. Commun. 12(2): 387-413 (2018) - Hannes Bartz, Antonia Wachter-Zeh:
Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases. Adv. Math. Commun. 12(4): 773-804 (2018) - Joaquim Borges, Cristina Fernández-Córdoba, Roger Ten-Valls:
On ℤprℤps-additive cyclic codes. Adv. Math. Commun. 12(1): 169-179 (2018) - Joaquim Borges, Josep Rifà, Victor A. Zinoviev:
Completely regular codes by concatenating Hamming codes. Adv. Math. Commun. 12(2): 337-349 (2018) - Nigel Boston, Jing Hao:
The weight distribution of quasi-quadratic residue codes. Adv. Math. Commun. 12(2): 363-385 (2018) - Delphine Boucher:
A first step towards the skew duadic codes. Adv. Math. Commun. 12(3): 553-577 (2018) - Marco Calderini:
A note on some algebraic trapdoors for block ciphers. Adv. Math. Commun. 12(3): 515-524 (2018) - Gokhan Calis, Onur Ozan Koyluoglu:
Architecture-aware coding for distributed storage: Repairable block failure resilient codes. Adv. Math. Commun. 12(3): 465-503 (2018) - Yonglin Cao, Yuan Cao, Hai Q. Dinh, Fang-Wei Fu, Jian Gao, Songsak Sriboonchitta:
Constacyclic codes of length nps over 𝔽pm+u𝔽pm. Adv. Math. Commun. 12(2): 231-262 (2018) - Ayça Çesmelioglu, Wilfried Meidl:
Bent and vectorial bent functions, partial difference sets, and strongly regular graphs. Adv. Math. Commun. 12(4): 691-705 (2018) - Sanjit Chatterjee, Chethan Kamath, Vikas Kumar:
Private set-intersection with common set-up. Adv. Math. Commun. 12(1): 17-47 (2018) - Zhixiong Chen, Vladimir Edemskiy, Pinhui Ke, Chenhuang Wu:
On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients. Adv. Math. Commun. 12(4): 805-816 (2018) - Guangzhou Chen, Yue Guo, Yong Zhang:
Further results on the existence of super-simple pairwise balanced designs with block sizes 3 and 4. Adv. Math. Commun. 12(2): 351-362 (2018) - Dean Crnkovic, Vedrana Mikulic Crnkovic, Bernardo Gabriel Rodrigues:
On self-orthogonal designs and codes related to Held's simple group. Adv. Math. Commun. 12(3): 607-628 (2018) - B. K. Dass, Namita Sharma, Rashmi Verma:
Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces. Adv. Math. Commun. 12(4): 629-639 (2018) - Konstantinos A. Draziotis, Anastasia Papadopoulou:
Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme. Adv. Math. Commun. 12(3): 429-449 (2018) - Lenny Fukshansky, Ahmad Adib Shaar:
A new family of one-coincidence sets of sequences with dispersed elements for frequency hopping cdma systems. Adv. Math. Commun. 12(1): 181-188 (2018) - Sugata Gangopadhyay, Goutam Paul, Nishant Sinha, Pantelimon Stanica:
Generalized nonlinearity of S-boxes. Adv. Math. Commun. 12(1): 115-122 (2018) - Motahhareh Gharahi, Shahram Khazaei:
Reduced access structures with four minimal qualified subsets on six participants. Adv. Math. Commun. 12(1): 199-214 (2018) - Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Indiscreet logarithms in finite fields of small characteristic. Adv. Math. Commun. 12(2): 263-286 (2018) - Kathryn Haymaker, Beth Malmskog, Gretchen L. Matthews:
Locally recoverable codes with availability t≥2 from fiber products of curves. Adv. Math. Commun. 12(2): 317-336 (2018) - Daniel Heinlein, Sascha Kurz:
Binary subspace codes in small ambient spaces. Adv. Math. Commun. 12(4): 817-839 (2018) - Somphong Jitman, Ekkasit Sangwisut:
The average dimension of the Hermitian hull of constayclic codes over finite fields of square order. Adv. Math. Commun. 12(3): 451-463 (2018) - JiYoon Jung, Carl Mummert, Elizabeth M. Niese, Michael Schroeder:
On erasure combinatorial batch codes. Adv. Math. Commun. 12(1): 49-65 (2018) - Pinhui Ke, Yueqin Jiang, Zhixiong Chen:
On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation. Adv. Math. Commun. 12(3): 525-539 (2018) - Yiwei Liu, Zihui Liu:
On some classes of codes with a few weights. Adv. Math. Commun. 12(2): 415-428 (2018) - Zihui Liu, Dajian Liao:
Higher weights and near-MDR codes over chain rings. Adv. Math. Commun. 12(4): 761-772 (2018)
skipping 18 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-24 02:33 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