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
Showing cs.ITShow all

12 papers · 1 filter

cs.IT2022

Isometries and MacWilliams Extension Property for Weighted Poset Metric

Yang Xu, Haibin Kan, Guangyue Han

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

cs.IT2022

Reflexivity of Partitions Induced by Weighted Poset Metric and Combinatorial Metric

Yang Xu, Haibin Kan, Guangyue Han

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

cs.IT2021

Fourier-Reflexive Partitions Induced by Poset Metric

Yang Xu, Haibin Kan, Guangyue Han

Let 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.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 of the form $x^3+a(x^{2^s+1})…

cs.IT2020

A Galois Connection Approach to Wei-Type Duality Theorems

Yang Xu, Haibin Kan, Guangyue Han

In , 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 be an even positive integer, and 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 -functions with maximal number of bent components

Lijing Zheng, Jie Peng, Haibin Kan +2

For any positive integers and such that , in this paper we show the maximal number of bent components of any -functions is equal to , 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 is a combinatorial design used in space-time block codes (STBCs). For STBC, is the number of antennas, 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.IT2011

On the nonexistence of , odd, complex orthogonal design

Yuan Li, Haibin Kan

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD with parameter is a matrix, where nonzero entries are fi…

cs.IT2011

Complex Orthogonal Designs with Forbidden Submatrices

Yuan Li, Haibin Kan

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD with parameter is a matrix, where nonzero entries are f…