Tao Feng

发表

Existence of Z -cyclic 3PTWh ( p ) for any Prime p congruent 1 (mod 4).

Yanxun Chang, Tao Feng, 2006 .

A new construction of perfect nonlinear functions using Galois rings

Tao Feng, 2009 .

Group divisible

packings with any minimum leave

Yanxun Chang, Tao Feng, Yufeng Gao, 2018 .

Group divisible (K4−e) ‐packings with any minimum leave

Yanxun Chang, Tao Feng, Yufeng Gao, 2017, 1705.08787.

Simple Minimum (K4 − e)-coverings of Complete Multipartite Graphs

Yanxun Chang, Tao Feng, Yufeng Gao, 2019, Acta Mathematica Sinica, English Series.

C O ] 1 2 A pr 2 01 8 Optimal 2-D ( n × m , 3 , 2 , 1 )-optical orthogonal codes and related equi-difference conflict avoiding codes 1

Tao Feng, Xiaomiao Wang, Lidong Wang, 2018 .

The existence of NBIBDs with k 1 = 6 and λ 1 = 5 1

Yanxun Chang, Tao Feng, 2011 .

Improved cyclotomic conditions leading to new $2$-designs: the use of strong difference families

Tao Feng, S. Costa, Xiaomiao Wang, 2017 .

Frame difference families and resolvable balanced incomplete block designs

Tao Feng, S. Costa, Xiaomiao Wang, 2017, Designs, Codes and Cryptography.

Partitionable sets, almost partitionable sets, and their applications

Yanxun Chang, Tao Feng, S. Costa, 2019, Journal of Combinatorial Designs.

C O ] 1 7 N ov 2 01 9 Partitionable sets , almost partitionable sets and their applications 1

Yanxun Chang, Tao Feng, S. Costa, 2019 .

Strong difference families with special patterns

Yanxun Chang, Tao Feng, S. Costa, 2019, 1901.06837.

Decompositions of the 3-uniform hypergraphs Kv(3) into hypergraphs of a certain type

Yanxun Chang, Tao Feng, 2007 .

Group Divisible Packings and Coverings with Any Minimum Leave and Minimum Excess

Yanxun Chang, Tao Feng, Xijuan Hu, 2015, Graphs and Combinatorics.

Leaves for packings with block size four.

Yanxun Chang, Tao Feng, P. Dukes, 2019, 1905.12151.

Semi-cyclic holey group divisible designs with block size three

Yanxun Chang, Tao Feng, Xiaomiao Wang, 2013, Designs, Codes and Cryptography.

Semi-cyclic holey group divisible designs with block size three

Tao Feng, Yanxun Chang, Xiaomiao Wang, 2013, Des. Codes Cryptogr..

Optimal 2-D (n×m, 3, 2, 1)-optical Orthogonal Codes

Tao Feng, Yanxun Chang, Xiaomiao Wang, 2013, IEEE Trans. Inf. Theory.

New constructions of large cyclic subspace codes and Sidon spaces

Tao Feng, Ye Wang, Tao Feng, 2021, Discret. Math..

Multi-value private information retrieval with colluding databases via trace functions

Tao Feng, Yueting Li, Yanxun Chang, 2021, Inf. Sci..

Several classes of optimal Ferrers diagram rank-metric codes

Tao Feng, Yanxun Chang, Shuangqing Liu, 2018, Linear Algebra and its Applications.

New 2-designs from strong difference families

Tao Feng, Simone Costa, Xiaomiao Wang, 2017, Finite Fields Their Appl..

Parallel Multilevel Constructions for Constant Dimension Codes

Tao Feng, Yanxun Chang, Shuangqing Liu, 2019, IEEE Transactions on Information Theory.

Constructions for Optimal Ferrers Diagram Rank-Metric Codes

Tao Feng, Yanxun Chang, Shuangqing Liu, 2018, IEEE Transactions on Information Theory.

Frame difference families and resolvable balanced incomplete block designs

Tao Feng, Xiaomiao Wang, Simone Costa, 2018, Designs, Codes and Cryptography.

New 2 -designs from strong diﬀerence families 1

Tao Feng, Xiaomiao Wang, Simone Costa, 2017 .

The asymptotic existence of frames with a pair of orthogonal frame resolutions

Yanxun Chang, Tao Feng, Changyuan Wang, 2019, Science China Mathematics.

The asymptotic existence of frames with a pair of orthogonal frame resolutions

Tao Feng, Changyuan Wang, Y. Chang, 2019, Science China Mathematics.

Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes With $\lambda=2$

Tao Feng, Yanxun Chang, Yanxun Chang, 2011, IEEE Transactions on Information Theory.

The existence spectrum of Meta(K4(3)>K4(3) − e)

Giovanni Lo Faro, Antoinette Tripodi, Tao Feng, 2010 .

The spectrum of semicyclic holey group divisible designs with block size three

Tao Feng, Xiaomiao Wang, Lidong Wang, 2019, Journal of Combinatorial Designs.

Optimal Two‐Dimensional Optical Orthogonal Codes with the Best Cross‐Correlation Constraint

Tao Feng, Yancai Zhao, Xiaomiao Wang, 2017 .

Optimal 2-D (n×m,3,2,1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(n\times m,3,2,1)$$\end{document}-optical ortho

Tao Feng, Lidong Wang, Xiaomiao Wang, 2018, Designs, Codes and Cryptography.

On self-orthogonal group ring codes

Tao Feng, Wenqing Fu, Tao Feng, 2009, Des. Codes Cryptogr..

Classification of Cyclic Steiner Quadruple Systems

Derek F. Holt, Patric R. J. Östergård, Tao Feng, 2017 .

Cyclic balanced sampling plans excluding contiguous units with block size four

Tao Feng, Xiaomiao Wang, Chao Guo, 2022, Discret. Math..

Semi–cyclic Holey Group Divisible Designs and Applications to Sampling Designs and Optical Orthogonal Codes

Tao Feng, R. Wei, Xiaomiao Wang, 2016 .

Two-dimensional balanced sampling plans avoiding adjacent units

Jing Zhang, Tao Feng, Yan Xu, 2014, Discret. Math..

C O ] 2 2 O ct 2 01 4 Semi-cyclic holey group divisible designs and applications to sampling designs and optical orthogonal codes

Tao Feng, R. Wei, Xiaomiao Wang, 2014 .