default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuansheng Tang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Ming Xu, Xiaoyan Cheng, Yuansheng Tang:
On the girth cycles of the bipartite graph D(k,q). Discret. Math. 346(9): 113500 (2023)- [j14]Ming Xu, Xiaoyan Cheng, Yuansheng Tang:
Girth of the algebraic bipartite graph D(k,q). Finite Fields Their Appl. 92: 102296 (2023) - 2021
- [j13]Ming Xu, Xiaoyan Cheng, Yuansheng Tang:
On the characterization of some algebraically defined bipartite graphs of girth eight. Discret. Appl. Math. 305: 221-232 (2021)
2010 – 2019
- 2017
- [j12]Hua Liang, Wenbing Chen, Jinquan Luo, Yuansheng Tang:
A new nonbinary sequence family with low correlation and large size. Adv. Math. Commun. 11(4): 671-691 (2017) - [j11]Hua Liang, Jinquan Luo, Yuansheng Tang:
On cross-correlation of a binary m-sequence of period 22k-1 and its decimated sequences by (2lk+1)/(2l+1). Adv. Math. Commun. 11(4): 693-703 (2017) - 2016
- [j10]Xiaoyan Cheng, Wenbing Chen, Yuansheng Tang:
On the conjecture for the girth of the bipartite graph D(k, q). Discret. Math. 339(9): 2384-2392 (2016) - 2015
- [j9]Wenbing Chen, Jinquan Luo, Yuansheng Tang, Quanquan Liu:
Some new results on cross correlation of p-ary m-sequence and its decimated sequence. Adv. Math. Commun. 9(3): 375-390 (2015) - [j8]Hua Liang, Yuansheng Tang:
The cross correlation distribution of a p-ary m-sequence of period pm-1 and its decimated sequences by (pk+1)(pm+1)/4. Finite Fields Their Appl. 31: 137-161 (2015) - [j7]Wenbing Chen, Jinquan Luo, Yuansheng Tang:
Exponential Sums From Half Quadratic Forms and Their Applications. IEEE Trans. Inf. Theory 61(10): 5331-5341 (2015) - 2014
- [j6]Xiaoyan Cheng, Wenbing Chen, Yuansheng Tang:
On the girth of the bipartite graph D(k, q). Discret. Math. 335: 25-34 (2014) - [c3]Wenbing Chen, Jinquan Luo, Yuansheng Tang:
Exponential sum from half quadratic forms and its application. ISIT 2014: 3145-3149 - 2011
- [e1]Yeow Meng Chee, Zhenbo Guo, San Ling, Fengjing Shao, Yuansheng Tang, Huaxiong Wang, Chaoping Xing:
Coding and Cryptology - Third International Workshop, IWCC 2011, Qingdao, China, May 30-June 3, 2011. Proceedings. Lecture Notes in Computer Science 6639, Springer 2011, ISBN 978-3-642-20900-0 [contents] - 2010
- [j5]Jinquan Luo, Yuansheng Tang, Hongyu Wang:
Cyclic codes and sequences: the generalized Kasami case. IEEE Trans. Inf. Theory 56(5): 2130-2142 (2010)
2000 – 2009
- 2009
- [j4]Yuansheng Tang, Xinmei Huang:
A Note on Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding. IEEE Trans. Inf. Theory 55(3): 1047-1050 (2009) - [c2]Jinquan Luo, Yuansheng Tang, Hongyu Wang:
On the weight distribution of a class of cyclic codes. ISIT 2009: 1726-1729 - [i2]Jinquan Luo, Yuansheng Tang, Hongyu Wang:
Exponential Sums, Cyclic Codes and Sequences: the Odd Characteristic Kasami Case. CoRR abs/0902.4508 (2009) - [i1]Jinquan Luo, Hongyu Wang, Yuansheng Tang:
Cyclic Codes and Sequences: the Generalized Kasami Case. CoRR abs/0902.4510 (2009) - 2006
- [j3]Yuansheng Tang, San Ling
, Fang-Wei Fu:
On the reliability-order-based decoding algorithms for binary linear block codes. IEEE Trans. Inf. Theory 52(1): 328-336 (2006) - 2004
- [j2]Yuansheng Tang, San Ling:
On Viterbi-like algorithms and their application to Reed-Muller codes. J. Complex. 20(2-3): 438-457 (2004) - 2002
- [j1]Yuansheng Tang, Toru Fujiwara, Tadao Kasami:
Asymptotic optimality of the GMD and chase decoding algorithms. IEEE Trans. Inf. Theory 48(8): 2401-2405 (2002)
1990 – 1999
- 1999
- [c1]Yuansheng Tang, Tadao Kasami, Toru Fujiwara:
An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity. AAECC 1999: 201-210
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-04-25 05:52 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:
