default search action
Aixian Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j16]Aixian Zhang
, Xiaoyan Jing
Optimal Combinatorial Neural Codes With Matched Metric δr: Characterization and Constructions. IEEE Trans. Inf. Theory 69(8): 5440-5448 (2023) - [j15]Xiaoyan Jing
Arithmetic Autocorrelation Distribution of Binary m-Sequences. IEEE Trans. Inf. Theory 69(9): 6040-6047 (2023) - 2022
- [j14]Aixian Zhang, Keqin Feng:
On the constructions of MDS self-dual codes via cyclotomy. Finite Fields Their Appl. 77: 101947 (2022) - [i10]Xiaoyan Jing, Aixian Zhang, Keqin Feng:
Arithmetic autocorrelation distribution of binary m-sequences. CoRR abs/2211.16766 (2022) - 2021
- [j13]Maosheng Xiong
On Cyclic Codes of Composite Length and the Minimum Distance II. IEEE Trans. Inf. Theory 67(8): 5097-5103 (2021) - [i9]Aixian Zhang, Xiaoyan Jin, Keqin Feng:
Optimal Combinatorial Neural Codes with Matched Metric δr: Characterization and Constructions. CoRR abs/2112.07903 (2021) - 2020
- [j12]Aixian Zhang
A Unified Approach to Construct MDS Self-Dual Codes via Reed-Solomon Codes. IEEE Trans. Inf. Theory 66(6): 3650-3656 (2020)
2010 – 2019
- 2019
- [j11]Aixian Zhang, Zhe Ji:
New Construction of Maximum Distance Separable (MDS) Self-Dual Codes over Finite Fields. Entropy 21(2): 101 (2019) - [i8]Aixian Zhang, Keqin Feng:
An Unified Approach on Constructing of MDS Self-dual Codes via Reed-Solomon Codes. CoRR abs/1905.06513 (2019) - [i7]Aixian Zhang, Keqin Feng:
On the Constructions of MDS Self-dual Codes via Cyclotomy. CoRR abs/1911.05234 (2019) - 2018
- [j10]Jin Li, Aixian Zhang, Keqin Feng:
Linear codes over Fq[x]/(x2) and GR(p2, m) reaching the Griesmer bound. Des. Codes Cryptogr. 86(12): 2837-2855 (2018) - [j9]Aixian Zhang, Keqin Feng:
Normal Bases on Galois Ring Extensions. Symmetry 10(12): 702 (2018) - 2016
- [i6]Aixian Zhang, Jin Li, Keqin Feng:
Linear Codes over Galois Ring GR(p2, r) Related to Gauss sums. CoRR abs/1603.02018 (2016) - [i5]Jin Li, Aixian Zhang, Keqin Feng:
Linear Codes over Fq[x]/(x2) and GR(p2, m) Reaching the Griesmer Bound. CoRR abs/1612.01096 (2016) - 2015
- [j8]Aixian Zhang, Zhengchun Zhou
A lower bound on the average Hamming correlation of frequency-hopping sequence sets. Adv. Math. Commun. 9(1): 55-62 (2015) - [j7]Aixian Zhang, Keqin Feng:
A new criterion on normal bases of finite field extensions. Finite Fields Their Appl. 31: 25-41 (2015) - 2014
- [j6]Nam Yul Yu
A new class of near-optimal partial Fourier codebooks from an almost difference set. Des. Codes Cryptogr. 71(3): 493-501 (2014) - [i4]Aixian Zhang, Keqin Feng:
A New Criterion on Normal Bases of Finite Field Extensions. CoRR abs/1407.3647 (2014) - 2013
- [j5]Cunsheng Ding
Unit time-phase signal sets: Bounds and constructions. Cryptogr. Commun. 5(3): 209-227 (2013) - [j4]Zhengchun Zhou
The Weight Enumerator of Three Families of Cyclic Codes. IEEE Trans. Inf. Theory 59(9): 6002-6009 (2013) - [j3]Zhengchun Zhou
A Family of Five-Weight Cyclic Codes and Their Weight Enumerators. IEEE Trans. Inf. Theory 59(10): 6674-6682 (2013) - [i3]Zhengchun Zhou, Aixian Zhang, Cunsheng Ding, Maosheng Xiong:
The Weight Enumerator of Three Families of Cyclic Codes. CoRR abs/1301.4824 (2013) - [i2]Zhengchun Zhou, Cunsheng Ding, Jinquan Luo, Aixian Zhang:
A Family of Five-Weight Cyclic Codes and Their Weight Enumerators. CoRR abs/1302.0952 (2013) - 2012
- [j2]Aixian Zhang, Keqin Feng:
Construction of cyclotomic codebooks nearly meeting the Welch bound. Des. Codes Cryptogr. 63(2): 209-224 (2012) - [j1]Aixian Zhang, Keqin Feng:
Two Classes of Codebooks Nearly Meeting the Welch Bound. IEEE Trans. Inf. Theory 58(4): 2507-2511 (2012) - 2011
- [i1]Cunsheng Ding, Keqin Feng, Rongquan Feng, Aixian Zhang:
Bounds on and Constructions of Unit Time-Phase Signal Sets. CoRR abs/1112.0383 (2011)
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:55 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: