default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRongsheng Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Rongsheng Wu, Xiande Zhang
:
Balanced reconstruction codes for single edits. Des. Codes Cryptogr. 92(7): 2011-2029 (2024)- 2022
- [j11]Rongsheng Wu, Minjia Shi:
On $\mathbb {Z}_2\mathbb {Z}_4$-additive polycyclic codes and their Gray images. Des. Codes Cryptogr. 90(11): 2551-2562 (2022) - [j10]Rongsheng Wu, Minjia Shi, Patrick Solé:
On the structure of 1-generator quasi-polycyclic codes over finite chain rings. J. Appl. Math. Comput. 68(5): 3491-3503 (2022) - [j9]Minjia Shi, Rongsheng Wu, Denis S. Krotov:
On q-Ary Shortened-1-Perfect-Like Codes. IEEE Trans. Inf. Theory 68(11): 7100-7106 (2022) - [i7]Rongsheng Wu, Xiande Zhang:
Balanced reconstruction codes for single edits. CoRR abs/2207.00832 (2022) - 2021
- [j8]Rongsheng Wu, Minjia Shi:
Some Classes of Mixed Alphabet Codes With Few Weights. IEEE Commun. Lett. 25(5): 1431-1434 (2021) - [j7]Minjia Shi, Thomas Honold, Patrick Solé, Yunzhen Qiu, Rongsheng Wu, Zahra Sepasdar:
The Geometry of Two-Weight Codes Over ℤpm. IEEE Trans. Inf. Theory 67(12): 7769-7781 (2021) - [i6]Minjia Shi, Rongsheng Wu, Denis S. Krotov:
On q-ary shortened-1-perfect-like codes. CoRR abs/2110.05256 (2021) - [i5]Rongsheng Wu, Minjia Shi, Patrick Solé:
On the structure of $1$-generator quasi-polycyclic codes over finite chain rings. CoRR abs/2111.04914 (2021) - 2020
- [j6]Tiantian Li, Rongsheng Wu, Juan Xu:
Linear Codes Over a Non-Chain Ring and the MacWilliams Identities. IEEE Access 8: 87115-87120 (2020) - [j5]Minjia Shi, Chenchen Wang, Rongsheng Wu, Yu Hu, Yaoqiang Chang:
One-weight and two-weight $\mathbb {Z}_{2}\mathbb {Z}_{2}[u, v]$-additive codes. Cryptogr. Commun. 12(3): 443-454 (2020) - [j4]Rongsheng Wu, Minjia Shi:
A modified Gilbert-Varshamov bound for self-dual quasi-twisted codes of index four. Finite Fields Their Appl. 62: 101627 (2020)
2010 – 2019
- 2019
- [j3]Minjia Shi, Rongsheng Wu, Denis S. Krotov:
On $Z_p Z_{p^k}$ -Additive Codes and Their Duality. IEEE Trans. Inf. Theory 65(6): 3841-3847 (2019) - 2018
- [j2]Minjia Shi, Rongsheng Wu, Patrick Solé:
Asymptotically Good Additive Cyclic Codes Exist. IEEE Commun. Lett. 22(10): 1980-1983 (2018) - [i4]Minjia Shi, Rongsheng Wu, Denis S. Krotov:
On ZpZpk-additive codes and their duality. CoRR abs/1809.00008 (2018) - 2017
- [j1]Minjia Shi, Rongsheng Wu, Yan Liu, Patrick Solé:
Two and three weight codes over $\mathbb {F}_{p}+u\mathbb {F}_{p}$. Cryptogr. Commun. 9(5): 637-646 (2017) - [i3]Minjia Shi, Zahra Sepasdar, Rongsheng Wu, Patrick Solé:
Two weight Zpk-codes, p odd prime. CoRR abs/1708.05347 (2017) - [i2]Minjia Shi, Rongsheng Wu, Patrick Solé:
Long cyclic codes are good. CoRR abs/1709.09865 (2017) - 2016
- [i1]Rongsheng Wu, Minjia Shi, Patrick Solé:
Several Classes of $p$-ary Linear Codes with Few Weights. CoRR abs/1612.00915 (2016)
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 2025-01-21 00:21 CET 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:
