Haibin Kan

activity

20112023

most citedOn the Minimum Decoding Delay of Balanced Complex Orthogonal Design

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

collaborators

20 papers

math.CO2023

A Gröbner Basis Approach to Combinatorial Nullstellensatz

Yang Xu, Haibin Kan, Guangyue Han

In this paper, using some conditions that arise naturally in Alon's combinatorial Nullstellensatz as well as its various extensions and generalizations, we characterize Gröbner bas…

cs.SI2022

Resistance Distances in Simplicial Networks

Mingzhe Zhu, Wanyue Xu, Zhongzhi Zhang +2

It is well known that in many real networks, such as brain networks and scientific collaboration networks, there exist higher-order nonpairwise relations among nodes, i.e., interac…

cs.SI2022

Hitting Times of Random Walks on Edge Corona Product Graphs

Mingzhe Zhu, Wanyue Xu, Wei Li +2

Graph products have been extensively applied to model complex networks with striking properties observed in real-world complex systems. In this paper, we study the hitting times fo…

cs.IT2022

Isometries and MacWilliams Extension Property for Weighted Poset Metric

Yang Xu, Haibin Kan, Guangyue Han

Let $H$ be the cartesian product of a family of left modules over a ring $S$ , indexed by a finite set $Ω$ . We are concerned with the $(P, ω)$ -weight on $\mathbf{H}…

cs.IT2022

Reflexivity of Partitions Induced by Weighted Poset Metric and Combinatorial Metric

Yang Xu, Haibin Kan, Guangyue Han

Let $H$ be the Cartesian product of a family of finite abelian groups. Via a polynomial approach, we give sufficient conditions for a partition of $H$ induced by…

cs.SI2021

Role Similarity Metric Based on Spanning Rooted Forest

Qi Bao, Zhongzhi Zhang, Haibin Kan

As a fundamental issue in network analysis, structural node similarity has received much attention in academia and is adopted in a wide range of applications. Among these proposed…

cs.IT2021

Fourier-Reflexive Partitions Induced by Poset Metric

Yang Xu, Haibin Kan, Guangyue Han

Let $H$ be the cartesian product of a family of finite abelian groups indexed by a finite set $Ω$ . A given poset (i.e., partially ordered set) $\mathbf{P}=(Ω,\preccurlyeq_…

cs.CG2021

Some Combinatorial Problems in Power-law Graphs

Jiang Che, Xu Wanyue, Zhou Xiaotian +2

The power-law behavior is ubiquitous in a majority of real-world networks, and it was shown to have a strong effect on various combinatorial, structural, and dynamical properties o…

cs.IT2021★ 1 cited

Constructing new APN functions through relative trace functions

Lijing Zheng, Haibin Kan, Yanjun Li +2

In 2020, Budaghyan, Helleseth and Kaleyski [IEEE TIT 66(11): 7081-7087, 2020] considered an infinite family of quadrinomials over $F_{2^{n}}$ of the form $x^3+a(x^{2^s+1})…

math.NA2021★ 8 cited

Coherence Scaling of Noisy Second-Order Scale-Free Consensus Networks

Wanyue Xu, Bin Wu, Zuobai Zhang +3

A striking discovery in the field of network science is that the majority of real networked systems have some universal structural properties. In generally, they are simultaneously…

cs.IT2020

A Galois Connection Approach to Wei-Type Duality Theorems

Yang Xu, Haibin Kan, Guangyue Han

In $1991$ , Wei proved a duality theorem that established an interesting connection between the generalized Hamming weights of a linear code and those of its dual code. Wei's dualit…

cs.IT2019

Constructing vectorial bent functions via second-order derivatives

Lijing Zheng, Jie Peng, Haibin Kan +1

Let $n$ be an even positive integer, and $m < n$ be one of its positive divisors. In this paper, inspired by a nice work of Tang et al. on constructing large classes of bent function…

cs.IT2019

On constructions and properties of $(n, m)$ -functions with maximal number of bent components

Lijing Zheng, Jie Peng, Haibin Kan +2

For any positive integers $n = 2 k$ and $m$ such that $m \geq k$ , in this paper we show the maximal number of bent components of any $(n, m)$ -functions is equal to $2^{m} - 2^{m - k}$ , and…

cs.IT2017★ 1 cited

A Novel Construction of Low-Complexity MDS Codes with Optimal Repair Capability for Distributed Storage Systems

Sheng Guan, Haibin Kan, Xin Wang

Maximum-distance-separable (MDS) codes are a class of erasure codes that are widely adopted to enhance the reliability of distributed storage systems (DSS). In (n, k) MDS coded DSS…

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

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…

A Gröbner Basis Approach to Combinatorial Nullstellensatz

Resistance Distances in Simplicial Networks

Hitting Times of Random Walks on Edge Corona Product Graphs

Isometries and MacWilliams Extension Property for Weighted Poset Metric

Reflexivity of Partitions Induced by Weighted Poset Metric and Combinatorial Metric

Role Similarity Metric Based on Spanning Rooted Forest

Fourier-Reflexive Partitions Induced by Poset Metric

Some Combinatorial Problems in Power-law Graphs

Constructing new APN functions through relative trace functions

Coherence Scaling of Noisy Second-Order Scale-Free Consensus Networks

A Galois Connection Approach to Wei-Type Duality Theorems

Constructing vectorial bent functions via second-order derivatives

On constructions and properties of (n,m)-functions with maximal number of bent components

A Novel Construction of Low-Complexity MDS Codes with Optimal Repair Capability for Distributed Storage Systems

On the Minimum Decoding Delay of Balanced Complex Orthogonal Design

Capacity Factors of a Point-to-point Network

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

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

On the nonexistence of [(m−12m​),2m,(m−12m−1​)], m odd, complex orthogonal design

Complex Orthogonal Designs with Forbidden 2×2 Submatrices

On constructions and properties of $(n, m)$ -functions with maximal number of bent components

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

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

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

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