default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShuxing Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Shuxing Li
, Jiawei Xu, Honghua Dong, Yu Yang, Chun Yuan, Peng Sun, Lei Han:
The Fittest Wins: A Multistage Framework Achieving New SOTA in ViZDoom Competition. IEEE Trans. Games 16(1): 225-234 (2024)- 2023
- [j28]Jonathan Jedwab, Shuxing Li, Samuel Simon:
Constructions and Restrictions for Balanced Splittable Hadamard Matrices. Electron. J. Comb. 30(1) (2023) - [j27]Jingzhou Na, Jonathan Jedwab, Shuxing Li:
A group-based structure for perfect sequence covering arrays. Des. Codes Cryptogr. 91(3): 951-970 (2023) - [j26]Jiawei Xu, Shuxing Li, Rui Yang, Chun Yuan, Lei Han:
Efficient Multi-Goal Reinforcement Learning via Value Consistency Prioritization. J. Artif. Intell. Res. 77: 355-376 (2023) - [j25]Ka Hin Leung, Shuxing Li, Songtao Mao:
Nonexistence results of generalized bent functions from Z2n to Zm. J. Comb. Theory A 198: 105763 (2023) - 2022
- [i16]Jonathan Jedwab, Shuxing Li, Samuel Simon:
Constructions and restrictions for balanced splittable Hadamard matrices. CoRR abs/2207.03619 (2022) - 2021
- [j24]Gohar M. Kyureghyan, Shuxing Li, Alexander Pott:
On the Intersection Distribution of Degree Three Polynomials and Related Topics. Electron. J. Comb. 28(2): 2 (2021) - [j23]Ka Hin Leung, Shuxing Li, Theo Fanuela Prabowo:
Nonexistence of strong external difference families in abelian groups of order being product of at most three primes. J. Comb. Theory A 178: 105338 (2021) - [c2]Yebin Zhao, Qixin Lv, Shuxing Li, Hongjun Xia, Dayong Zhang:
Numerical Simulation of the Docking Process for Large Offshore Wind Turbines. AIAM (ACM) 2021: 456-461 - 2020
- [j22]Shuxing Li, Alexander Pott:
A direct construction of primitive formally dual pairs having subsets with unequal sizes. Cryptogr. Commun. 12(3): 469-483 (2020) - [j21]Shuxing Li, Alexander Pott:
Intersection distribution, non-hitting index and Kakeya sets in affine planes. Finite Fields Their Appl. 66: 101691 (2020) - [j20]Shuxing Li, Wilfried Meidl, Alexandr Polujan, Alexander Pott, Constanza Riera, Pantelimon Stanica:
Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application. IEEE Trans. Inf. Theory 66(11): 7101-7112 (2020) - [i15]Shuxing Li, Alexander Pott:
Intersection distribution, non-hitting index and Kakeya sets in affine planes. CoRR abs/2003.06678 (2020) - [i14]Gohar M. Kyureghyan, Shuxing Li, Alexander Pott:
On the intersection distribution of degree three polynomials and related topics. CoRR abs/2003.10040 (2020) - [i13]Shuxing Li, Wilfried Meidl, Alexandr Polujan, Alexander Pott, Constanza Riera, Pantelimon Stanica:
Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application. CoRR abs/2006.01941 (2020) - [i12]Peng Sun, Jiechao Xiong, Lei Han, Xinghai Sun, Shuxing Li, Jiawei Xu, Meng Fang, Zhengyou Zhang:
TLeague: A Framework for Competitive Self-Play based Distributed Multi-Agent Reinforcement Learning. CoRR abs/2011.12895 (2020)
2010 – 2019
- 2019
- [j19]Shuxing Li:
On the weight distribution of second order Reed-Muller codes and their relatives. Des. Codes Cryptogr. 87(10): 2447-2460 (2019) - [j18]Shuxing Li, Alexander Pott, Robert Schüler:
Formal duality in finite abelian groups. J. Comb. Theory A 162: 354-405 (2019) - [i11]Shuxing Li:
On the weight distribution of second order Reed-Muller codes and their relatives. CoRR abs/1903.08058 (2019) - 2017
- [j17]Shuxing Li, Hengjia Wei, Gennian Ge:
Generic constructions for partitioned difference families with applications: a unified combinatorial approach. Des. Codes Cryptogr. 82(3): 583-599 (2017) - [j16]Shuxing Li, Gennian Ge:
Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes. Des. Codes Cryptogr. 84(3): 359-372 (2017) - [j15]Shuxing Li:
The weight hierarchy of a family of cyclic codes with arbitrary number of nonzeroes. Finite Fields Their Appl. 45: 355-371 (2017) - [j14]Shuxing Li:
The Minimum Distance of Some Narrow-Sense Primitive BCH Codes. SIAM J. Discret. Math. 31(4): 2530-2569 (2017) - [j13]Chengju Li, Cunsheng Ding, Shuxing Li:
LCD Cyclic Codes Over Finite Fields. IEEE Trans. Inf. Theory 63(7): 4344-4356 (2017) - [j12]Shuxing Li, Chengju Li, Cunsheng Ding, Hao Liu:
Two Families of LCD BCH Codes. IEEE Trans. Inf. Theory 63(9): 5699-5717 (2017) - [j11]Shuxing Li, Cunsheng Ding, Maosheng Xiong, Gennian Ge:
Narrow-Sense BCH Codes Over GF(q) With Length n=(qm-1)/(q-1). IEEE Trans. Inf. Theory 63(11): 7219-7236 (2017) - [i10]Shuxing Li:
The Weight Hierarchy of a Family of Cyclic Codes with Arbitrary Number of Nonzeroes. CoRR abs/1702.01309 (2017) - [i9]Shuxing Li:
The Minimum Distance of Some Narrow-Sense Primitive BCH Codes. CoRR abs/1711.01074 (2017) - 2016
- [j10]Shuxing Li, Maosheng Xiong, Gennian Ge:
Pseudo-cyclic Codes and the Construction of Quantum MDS Codes. IEEE Trans. Inf. Theory 62(4): 1703-1710 (2016) - [j9]Maosheng Xiong, Shuxing Li, Gennian Ge:
The Weight Hierarchy of Some Reducible Cyclic Codes. IEEE Trans. Inf. Theory 62(7): 4071-4080 (2016) - [i8]Shuxing Li, Cunsheng Ding, Maosheng Xiong, Gennian Ge:
Narrow-Sense BCH Codes over $\gf(q)$ with Length $n=\frac{q^m-1}{q-1}$. CoRR abs/1603.07009 (2016) - [i7]Shuxing Li, Cunsheng Ding, Hao Liu:
A Family of Reversible BCH Codes. CoRR abs/1608.02169 (2016) - [i6]Cunsheng Ding, Chengju Li, Shuxing Li:
LCD Cyclic Codes over Finite Fields. CoRR abs/1608.02170 (2016) - [i5]Shuxing Li, Gennian Ge:
Constructions of Maximum Distance Separable Symbol-Pair Codes Using Cyclic and Constacyclic Codes. CoRR abs/1608.02687 (2016) - 2015
- [j8]Sihuang Hu, Shuxing Li, Tao Zhang, Tao Feng, Gennian Ge:
New pseudo-planar binomials in characteristic two and related schemes. Des. Codes Cryptogr. 76(2): 345-360 (2015) - [c1]Jiongqi Wang, Zhangming He, Haiyin Zhou, Shuxing Li:
A General Process Model: Application to Unanticipated Fault Diagnosis. DX 2015: 137-144 - [i4]Maosheng Xiong, Shuxing Li, Gennian Ge:
The Weight Hierarchy of Some Reducible Cyclic Codes. CoRR abs/1504.01274 (2015) - 2014
- [j7]Tao Feng, Sihuang Hu, Shuxing Li, Gennian Ge:
Difference sets with few character values. Des. Codes Cryptogr. 73(3): 825-839 (2014) - [j6]Shuxing Li, Gennian Ge:
Deterministic Sensing Matrices Arising From Near Orthogonal Systems. IEEE Trans. Inf. Theory 60(4): 2291-2302 (2014) - [j5]Tao Zhang, Shuxing Li, Tao Feng, Gennian Ge:
Some New Results on the Cross Correlation of m-Sequences. IEEE Trans. Inf. Theory 60(5): 3062-3068 (2014) - [j4]Shuxing Li, Tao Feng, Gennian Ge:
On the Weight Distribution of Cyclic Codes With Niho Exponents. IEEE Trans. Inf. Theory 60(7): 3903-3912 (2014) - [j3]Shuxing Li, Gennian Ge:
Deterministic Construction of Sparse Sensing Matrices via Finite Geometry. IEEE Trans. Signal Process. 62(11): 2850-2859 (2014) - [i3]Shuxing Li, Tao Feng, Gennian Ge:
On the Weight Distribution of Cyclic Codes with Niho Exponents. CoRR abs/1401.1887 (2014) - 2013
- [j2]Shuxing Li, Sihuang Hu, Tao Feng, Gennian Ge:
The Weight Distribution of a Class of Cyclic Codes Related to Hermitian Forms Graphs. IEEE Trans. Inf. Theory 59(5): 3064-3067 (2013) - [i2]Tao Zhang, Shuxing Li, Tao Feng, Gennian Ge:
Some New Results on the Cross Correlation of $m$-sequences. CoRR abs/1309.7734 (2013) - 2012
- [j1]Shuxing Li, Fei Gao, Gennian Ge, Shengyuan Zhang:
Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves. IEEE Trans. Inf. Theory 58(8): 5035-5041 (2012) - [i1]Shuxing Li, Sihuang Hu, Tao Feng, Gennian Ge:
The Weight Distribution of a Class of Cyclic Codes Related to Hermitian Forms Graphs. CoRR abs/1212.6371 (2012)
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-10-07 21:23 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:
