![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 26 matches
- 2020
- Jean-Paul Allouche, Guo-Niu Han, Harald Niederreiter:
Perfect linear complexity profile and apwenian sequences. Finite Fields Their Appl. 68: 101761 (2020) - Clementa Alonso-González
, Miguel Ángel Navarro-Pérez
, Xaro Soler-Escrivà
:
Flag codes from planar spreads in network coding. Finite Fields Their Appl. 68: 101745 (2020) - Anibal Aravena:
Iterated constructions of completely normal polynomials. Finite Fields Their Appl. 68: 101755 (2020) - Daniele Bartoli, Massimo Giulietti, Motoko Qiu Kawakita, Maria Montanucci
:
New examples of maximal curves with low genus. Finite Fields Their Appl. 68: 101744 (2020) - Antonia W. Bluher
:
A structure theorem for finite fields. Finite Fields Their Appl. 68: 101732 (2020) - Martino Borello, Wolfgang Willems:
Group codes over fields are asymptotically good. Finite Fields Their Appl. 68: 101738 (2020) - Chao Chen:
Hasse polynomials of L-functions of certain exponential sums. Finite Fields Their Appl. 68: 101736 (2020) - René Bødker Christensen
, Olav Geil
:
On nested code pairs from the Hermitian curve. Finite Fields Their Appl. 68: 101742 (2020) - Tony Ezome, Mohamadou Sall:
On finite field arithmetic in characteristic 2. Finite Fields Their Appl. 68: 101739 (2020) - Dongchun Han:
A note on character sums in function fields. Finite Fields Their Appl. 68: 101734 (2020) - Xiang-Dong Hou, Christopher Sze:
On a type of permutation rational functions over finite fields. Finite Fields Their Appl. 68: 101758 (2020) - Sihem Mesnager
, Kwang Ho Kim, Jong Hyok Choe, Dok Nam Lee:
Solving some affine equations over finite fields. Finite Fields Their Appl. 68: 101746 (2020) - Semyon A. Novoselov
:
Counting points on hyperelliptic curves of type y2 = x2g+1 + axg+1 + bx. Finite Fields Their Appl. 68: 101757 (2020) - R. Padmanabhan, Alok Shukla
:
Orchards in elliptic curves over finite fields. Finite Fields Their Appl. 68: 101756 (2020) - Mariana Pérez
, Melina Privitelli:
Estimates on the number of Fq-rational solutions of variants of diagonal equations over finite fields. Finite Fields Their Appl. 68: 101728 (2020) - Charul Rajput
, Maheshanand Bhaintwal:
RS-like locally recoverable codes with intersecting recovering sets. Finite Fields Their Appl. 68: 101729 (2020) - Netanel Raviv
, Moshe Schwartz
, Rami Cohen
, Yuval Cassuto
:
Hierarchical erasure correction of linear codes. Finite Fields Their Appl. 68: 101743 (2020) - Lucas Reis
:
Counting solutions of special linear equations over finite fields. Finite Fields Their Appl. 68: 101759 (2020) - Minjia Shi, Xiaoxiao Li, Zahra Sepasdar, Patrick Solé:
Polycyclic codes as invariant subspaces. Finite Fields Their Appl. 68: 101760 (2020) - Igor E. Shparlinski
:
Geometric progressions in vector sumsets over finite fields. Finite Fields Their Appl. 68: 101747 (2020) - Jeffrey Lin Thunder:
The discriminant problem for Artin-Schreier extensions: Explicit results. Finite Fields Their Appl. 68: 101740 (2020) - Andrey Trepalin
:
Del Pezzo surfaces over finite fields. Finite Fields Their Appl. 68: 101741 (2020) - Ziran Tu, Xiangyong Zeng, Jinxiu Mao, Junchao Zhou:
Several classes of complete permutation polynomials over finite fields of even characteristic. Finite Fields Their Appl. 68: 101737 (2020) - Hong-Yu Wang
, Qun-Xiong Zheng
, Zhong-Xiao Wang, Wen-Feng Qi:
The minimal polynomials of modified de Bruijn sequences revisited. Finite Fields Their Appl. 68: 101735 (2020) - Yuyin Yu
, Nikolay S. Kaleyski
, Lilya Budaghyan, Yongqiang Li:
Classification of quadratic APN functions with coefficients in F2 for dimensions up to 9. Finite Fields Their Appl. 68: 101733 (2020) - Lijing Zheng, Haibin Kan, Jie Peng:
Two classes of permutation trinomials with Niho exponents over finite fields with even characteristic. Finite Fields Their Appl. 68: 101754 (2020)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-09-07 00:05 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