default search action
Tao Feng 0001
Person information
- affiliation: Zhejiang University, School of Mathematical Sciences, China
- affiliation (former): Nanyang Technological University, School of Physical and Mathematical Sciences, Singapore
- affiliation (former): University of Delaware, Department of Mathematical Sciences, Newark, USA
- affiliation (PhD 2008): Peking University, China
Other persons with the same name
- Tao Feng — disambiguation page
- Tao Feng 0002
— Beijing Jiaotong University, Institute of Mathematics, Beijing, China
- Tao Feng 0003
- Tao Feng 0004
- Tao Feng 0005
- Tao Feng 0006
- Tao Feng 0007
- Tao Feng 0008
- Tao Feng 0009
- Tao Feng 0010
- Tao Feng 0011 — University of Houston, Department of Computer Science, TX, USA
- Tao Feng 0012 — Cadence Design Systems, Inc., USA (and 1 more)
- Tao Feng 0013
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j42]Tao Feng
On finite generalized quadrangles with rmPSL(2, q) as an automorphism group. Des. Codes Cryptogr. 91(6): 2347-2364 (2023) - [j41]Tao Feng
New families of flag-transitive linear spaces. Finite Fields Their Appl. 87: 102156 (2023) - 2021
- [j40]Tao Feng, Weicong Li
On Transitive Ovoids of Finite Hermitian Polar Spaces. Comb. 41(5): 645-667 (2021) - [j39]Tao Feng, Ye Wang
New constructions of large cyclic subspace codes and Sidon spaces. Discret. Math. 344(4): 112273 (2021) - [j38]Tao Feng, Weicong Li
On codes in the projective linear group PGL(2, q). Finite Fields Their Appl. 75: 101812 (2021) - [j37]Tao Feng, Weicong Li
The point regular automorphism groups of the Payne derived quadrangle of W(q). J. Comb. Theory A 179: 105384 (2021) - [j36]Ran Tao
A Construction of Minimal Linear Codes From Partial Difference Sets. IEEE Trans. Inf. Theory 67(6): 3724-3734 (2021) - 2020
- [j35]Tao Feng, Ran Tao
An infinite family of m-ovoids of Q(4, q). Finite Fields Their Appl. 63: 101644 (2020) - [j34]Tao Feng, Ye Wang, Qing Xiang:
On m-ovoids of symplectic polar spaces. J. Comb. Theory A 175: 105279 (2020) - [i11]Ran Tao, Tao Feng, Weicong Li:
A construction of minimal linear codes from partial difference sets. CoRR abs/2008.12998 (2020)
2010 – 2019
- 2019
- [j33]Tao Feng
On the existence of O'Nan configurations in ovoidal Buekenhout-Metz unitals in PG(2, q2). Discret. Math. 342(8): 2324-2332 (2019) - [j32]Tao Feng
The Shift Bound for Abelian Codes and Generalizations of the Donoho-Stark Uncertainty Principle. IEEE Trans. Inf. Theory 65(8): 4673-4682 (2019) - 2018
- [j31]Tao Feng
On the isotopism classes of the Budaghyan-Helleseth commutative semifields. Finite Fields Their Appl. 53: 175-188 (2018) - 2017
- [j30]Jingxue Ma, Tao Zhang
Some new results on permutation polynomials over finite fields. Des. Codes Cryptogr. 83(2): 425-443 (2017) - [j29]Tao Feng
Finite flag-transitive affine planes with a solvable automorphism group. J. Comb. Theory A 152: 225-254 (2017) - 2016
- [j28]Tao Feng
A family of m-ovoids of parabolic quadrics. J. Comb. Theory A 140: 97-111 (2016) - [i10]Tao Feng:
Finite flag-transitive affine planes with a solvable automorphism group. CoRR abs/1609.07833 (2016) - 2015
- [j27]Tao Feng
Constructions of strongly regular Cayley graphs and skew Hadamard difference sets from cyclotomic classes. Comb. 35(4): 413-434 (2015) - [j26]Tao Zhang, Jerod Michel, Tao Feng, Gennian Ge:
On the Existence of Certain Optimal Self-Dual Codes with Lengths Between 74 and 116. Electron. J. Comb. 22(4): 4 (2015) - [j25]Yu Qing Chen, Tao Feng
Paley type sets from cyclotomic classes and Arasu-Dillon-Player difference sets. Des. Codes Cryptogr. 74(3): 581-600 (2015) - [j24]Sihuang Hu
New pseudo-planar binomials in characteristic two and related schemes. Des. Codes Cryptogr. 76(2): 345-360 (2015) - [j23]Tao Feng
On homogeneous planar functions. Finite Fields Their Appl. 31: 121-136 (2015) - [j22]Tao Feng
Cameron-Liebler line classes with parameter x=(q2-1)/2. J. Comb. Theory A 133: 307-338 (2015) - [j21]Tao Feng
A Characterization of Two-Weight Projective Cyclic Codes. IEEE Trans. Inf. Theory 61(1): 66-71 (2015) - [i9]Jingxue Ma, Tao Zhang, Tao Feng, Gennian Ge:
New results on permutation polynomials over finite fields. CoRR abs/1506.05525 (2015) - 2014
- [j20]Tao Feng
Difference sets with few character values. Des. Codes Cryptogr. 73(3): 825-839 (2014) - [j19]Tao Zhang
Some New Results on the Cross Correlation of m-Sequences. IEEE Trans. Inf. Theory 60(5): 3062-3068 (2014) - [j18]Shuxing Li, Tao Feng
On the Weight Distribution of Cyclic Codes With Niho Exponents. IEEE Trans. Inf. Theory 60(7): 3903-3912 (2014) - [i8]Shuxing Li, Tao Feng, Gennian Ge:
On the Weight Distribution of Cyclic Codes with Niho Exponents. CoRR abs/1401.1887 (2014) - [i7]Tao Zhang, Jerod Michel, Tao Feng, Gennian Ge:
On the Existence of Certain Optimal Self-Dual Codes with Lengths Between 74 and 116. CoRR abs/1405.7538 (2014) - 2013
- [j17]Yeow Meng Chee
Query-Efficient Locally Decodable Codes of Subexponential Length. Comput. Complex. 22(1): 159-189 (2013) - [j16]Yu Qing Chen, Tao Feng
Abelian and non-abelian Paley type group schemes. Des. Codes Cryptogr. 68(1-3): 141-154 (2013) - [j15]Tao Feng
Three-class association schemes from cyclotomy. J. Comb. Theory A 120(6): 1202-1215 (2013) - [j14]Shuxing Li, Sihuang Hu
The Weight Distribution of a Class of Cyclic Codes Related to Hermitian Forms Graphs. IEEE Trans. Inf. Theory 59(5): 3064-3067 (2013) - [j13]Tao Feng
Evaluation of the Weight Distribution of a Class of Cyclic Codes Based on Index 2 Gauss Sums. IEEE Trans. Inf. Theory 59(9): 5980-5984 (2013) - [i6]Tao Feng, Ka Hin Leung, Qing Xiang:
Binary Cyclic codes with two primitive nonzeros. CoRR abs/1301.4773 (2013) - [i5]Tao Zhang, Shuxing Li, Tao Feng, Gennian Ge:
Some New Results on the Cross Correlation of $m$-sequences. CoRR abs/1309.7734 (2013) - 2012
- [j12]Tao Feng
On cyclic codes of length 22r-1 with two zeros whose dual codes have three weights. Des. Codes Cryptogr. 62(3): 253-258 (2012) - [j11]Tao Feng
Pseudocyclic and non-amorphic fusion schemes of the cyclotomic association schemes. Des. Codes Cryptogr. 65(3): 247-257 (2012) - [j10]Tao Feng
Strongly regular graphs from unions of cyclotomic classes. J. Comb. Theory B 102(4): 982-995 (2012) - [j9]Tao Feng
Cyclotomic constructions of skew Hadamard difference sets. J. Comb. Theory A 119(1): 245-256 (2012) - [i4]Tao Feng, Gennian Ge, Sihuang Hu:
Association schemes related to Delsarte-Goethals codes. CoRR abs/1212.0347 (2012) - [i3]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) - 2011
- [j8]Alexander Pott, Yin Tan, Tao Feng
Association schemes arising from bent functions. Des. Codes Cryptogr. 59(1-3): 319-331 (2011) - [j7]Tao Feng
Non-abelian skew Hadamard difference sets fixed by a prescribed automorphism. J. Comb. Theory A 118(1): 27-36 (2011) - 2010
- [j6]Yin Tan, Alexander Pott, Tao Feng
Strongly regular graphs associated with ternary bent functions. J. Comb. Theory A 117(6): 668-682 (2010) - [i2]Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang, Liang Feng Zhang:
Query-Efficient Locally Decodable Codes of Subexponential Length. CoRR abs/1008.1617 (2010) - [i1]Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang, Liang Feng Zhang:
Query-Efficient Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j5]Wenqing Fu, Tao Feng
On self-orthogonal group ring codes. Des. Codes Cryptogr. 50(2): 203-214 (2009) - [j4]Tao Feng
Difference sets with n = 5 p r . Des. Codes Cryptogr. 51(2): 175-194 (2009) - 2008
- [j3]Cunsheng Ding
Codebooks from almost difference sets. Des. Codes Cryptogr. 46(1): 113-126 (2008) - [j2]Tao Feng
Semi-regular relative difference sets with large forbidden subgroups. J. Comb. Theory A 115(8): 1456-1473 (2008) - 2007
- [j1]Cunsheng Ding
A Generic Construction of Complex Codebooks Meeting the Welch Bound. IEEE Trans. Inf. Theory 53(11): 4245-4250 (2007)
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-23 20:33 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: