Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWenhui Li 0004
Person information
- affiliation: Skolkovo Institute of Science and Technology, Moscow, Russia
- affiliation (PhD 2015): Ulm University, Institute of Communications Engineering, Germany
Other persons with the same name
- Wenhui Li (aka: Wen-hui Li, Wen-Hui Li) — disambiguation page
- Wenhui Li 0001
![[0000-0001-9609-6120]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-9609-6120")
(aka: Wen-Hui Li 0001) — Tianjin University, School of Electrical and Information Engineering, China (and 1 more) - Wenhui Li 0002 (aka: Wen-hui Li 0002) — Jilin University, Key Laboratory of Symbolic Computation and Knowledge Engineering, Changchun, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c6]Wenhui Li, Vladimir Sidorenko, Antonia Wachter-Zeh:
On transform-domain decoding of generalized Gabidulin codes : Dedicated to the memory of Ernst M. Gabidulin (1937-2021). REDUNDANCY 2021: 131-136- [i3]Vladimir Sidorenko, Wenhui Li, Onur Günlü, Gerhard Kramer:
On Skew Convolutional and Trellis Codes. CoRR abs/2102.01510 (2021) - 2020
- [j3]Vladimir Sidorenko, Wenhui Li, Onur Günlü, Gerhard Kramer:
Skew Convolutional Codes. Entropy 22(12): 1364 (2020) - [c5]Vladimir Sidorenko, Wenhui Li, Gerhard Kramer:
On interleaved rank metric codes. ACCT 2020: 128-134 - [c4]Vladimir Sidorenko, Wenhui Li, Onur Günlü, Gerhard Kramer:
On Skew Convolutional and Trellis Codes. ITW 2020: 1-5
2010 – 2019
- 2019
- [c3]Wenhui Li, Vladimir Sidorenko, Thomas Jerkovits, Gerhard Kramer:
On Maximum-Likelihood Decoding of Time-Varying Trellis Codes. REDUNDANCY 2019: 104-109 - 2017
- [j2]Sven Puchinger, Johan Sebastian Rosenkilde, Wenhui Li, Vladimir Sidorenko:
Row reduction applied to decoding of rank-metric and subspace codes. Des. Codes Cryptogr. 82(1-2): 389-409 (2017) - 2015
- [b1]Wenhui Li:
Decoding evaluation codes and their interleaving. University of Ulm, 2015 - [i2]Wenhui Li, Johan Sebastian Rosenkilde Nielsen, Sven Puchinger, Vladimir Sidorenko:
Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation. CoRR abs/1501.04797 (2015) - [i1]Sven Puchinger, Johan Sebastian Rosenkilde Nielsen, Wenhui Li, Vladimir Sidorenko:
Row Reduction Applied to Decoding of Rank Metric and Subspace Codes. CoRR abs/1510.04728 (2015) - 2014
- [j1]Wenhui Li, Vladimir Sidorenko, Danilo Silva:
On transform-domain error and erasure correction by Gabidulin codes. Des. Codes Cryptogr. 73(2): 571-586 (2014) - 2013
- [c2]Wenhui Li, Vladimir Sidorenko, Johan Sebastian Rosenkilde Nielsen:
On decoding Interleaved Chinese Remainder codes. ISIT 2013: 1052-1056 - 2010
- [c1]Alexander Zeh, Wenhui Li:
Decoding Reed-Solomon codes up to the Sudan radius with the Euclidean algorithm. ISITA 2010: 986-990
Coauthor Index
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.
last updated on 2024-08-04 20:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
