Yuan Li

activity

20112023

most citedOn the Minimum Decoding Delay of Balanced Complex Orthogonal Design

9 citations · 9 across the 10 of their papers we have counts for

collaborators

10 papers

cs.CR2023

Trace Monomial Boolean Functions with Large High-Order Nonlinearities

Jinjie Gao, Haibin Kan, Yuan Li +2

Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity. We prove lower bo…

cs.IT2022

On the Uniqueness of Balanced Complex Orthogonal Design

Yiwen Gao, Yuan Li, Haibin Kan

Complex orthogonal designs (CODs) play a crucial role in the construction of space-time block codes. Their real analog, real orthogonal designs (or equivalently, sum of squares com…

cs.IT2022

The Covering Radius of the Third-Order Reed-Muller Code RM(3,7) is 20

Jinjie Gao, Haibin Kan, Yuan Li +1

We prove the covering radius of the third-order Reed-Muller code RM(3,7) is 20, which was previously known to be between 20 and 23 (inclusive). The covering radius of RM(3, 7) is t…

cs.IT2014★ 9 cited

On the Minimum Decoding Delay of Balanced Complex Orthogonal Design

Xiaodong Liu, Yuan Li, Haibin Kan

Complex orthogonal design (COD) with parameter $[p, n, k]$ is a combinatorial design used in space-time block codes (STBCs). For STBC, $n$ is the number of antennas, $k / p$ is the r…

cs.IT2012

Structure theorem of square complex orthogonal design

Yuan Li

Square COD (complex orthogonal design) with size $[n, n, k]$ is an $n \times n$ matrix $O_{z}$ , where each entry is a complex linear combination of $z_{i}$ and their conjugat…

cs.IT2012

Capacity Factors of a Point-to-point Network

Yuan Li, Yue Zhao, Haibin Kan

In this paper, we investigate some properties on capacity factors, which were proposed to investigate the link failure problem from network coding. A capacity factor (CF) of a netw…

cs.CR2011

On $2 k$ -Variable Symmetric Boolean Functions with Maximum Algebraic Immunity $k$

Hui Wang, Jie Peng, Yuan Li +1

Algebraic immunity of Boolean function $f$ is defined as the minimal degree of a nonzero $g$ such that $f g = 0$ or $(f + 1) g = 0$ . Given a positive even integer $n$ , it is found that the…

cs.CR2011

Constructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$

Yuan Li, Hui Wang, Haibin Kan

In this paper, we explicitly construct a large class of symmetric Boolean functions on $2 k$ variables with algebraic immunity not less than $d$ , where integer $k$ is given arbitrar…

cs.IT2011

On the nonexistence of $[(m - 1 2 m), 2 m, (m - 1 2 m - 1)]$ , $m$ odd, complex orthogonal design

Yuan Li, Haibin Kan

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $O_{z}$ with parameter $[p, n, k]$ is a $p \times n$ matrix, where nonzero entries are fi…

cs.IT2011

Complex Orthogonal Designs with Forbidden $2 \times 2$ Submatrices

Yuan Li, Haibin Kan

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $O_{z}$ with parameter $[p, n, k]$ is a $p \times n$ matrix, where nonzero entries are f…