activity
20112023
most citedA new class of hyper-bent Boolean functions in binomial forms

23 citations · 141 across the 48 of their papers we have counts for

collaborators
Showing 2019Show all

13 papers · 1 filter

cs.IT2019★ 14 cited

Full Characterization of Minimal Linear Codes as Cutting Blocking Sets

Chunming Tang, Yan Qiu, Qunying Liao +1

In this paper, we first study in detail the relationship between minimal linear codes and cutting blocking sets, which were recently introduced by Bonini and Borello, and then comp…

cs.IT2019★ 1 cited

Infinite families of near MDS codes holding -designs

Cunsheng Ding, Chunming Tang

An linear code is called an MDS code. An linear code is said to be almost maximum distance separable (almost MDS or AMDS for short). A code is said to…

cs.IT2019

Minimal linear codes from characteristic functions

Sihem Mesnager, Yanfeng Qi, Hongming Ru +1

Minimal linear codes have interesting applications in secret sharing schemes and secure two-party computation. This paper uses characteristic functions of some subsets of $\mathbb{…

cs.IT2019

Codes, differentially -uniform functions and -designs

Chunming Tang, Cunsheng Ding, Maosheng Xiong

Special functions, coding theory and -designs have close connections and interesting interplay. A standard approach to constructing -designs is the use of linear codes with c…

cs.IT2019

Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes

Cunsheng Ding, Chunming Tang, Vladimir D. Tonchev

In this paper, the 3-rank of the incidence matrices of 2-designs supported by the minimum weight codewords in a family of ternary linear codes considered in [C. Ding, C. Li, Infini…

cs.IT2019

Codebooks from generalized bent -valued quadratic forms

Yanfeng Qi, Sihem Mesnager, Chunming Tang

Codebooks with small inner-product correlation have application in unitary space-time modulations, multiple description coding over erasure channels, direct spread code division mu…

cs.IT2019★ 1 cited

Infinite families of 3-designs from APN functions

Chunming Tang

Combinatorial -designs have nice applications in coding theory, finite geometries and several engineering areas. The objective of this paper is to study how to obtain -design…

math.CO2019★ 7 cited

Infinite families of -designs from two classes of binary cyclic codes with three nonzeros

Xiaoni Du, Rong Wang, Chunming Tang +1

Combinatorial -designs have been an interesting topic in combinatorics for decades. It is a basic fact that the codewords of a fixed weight in a code may hold a -design. Till…

math.CO2019★ 6 cited

Infinite families of -designs from two classes of linear codes

Xiaoni Du, Rong Wang, Chunming Tang +1

The interplay between coding theory and -designs has attracted a lot of attention for both directions. It is well known that the supports of all codewords with a fixed weight in…

math.CO2019★ 6 cited

Combinatorial -designs from special polynomials

Cunsheng Ding, Chunming Tang

Combinatorial -designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing -designs. One of…

cs.IT2019

A class of narrow-sense BCH codes over of length

Xin Ling, Sihem Mesnager, Yanfeng Qi +1

BCH codes with efficient encoding and decoding algorithms have many applications in communications, cryptography and combinatorics design. This paper studies a class of linear code…

cs.CR2019★ 9 cited

On the boomerang uniformity of (quadratic) permutations over

Sihem Mesnager, Chunming Tang, Maosheng Xiong

At Eurocrypt'18, Cid, Huang, Peyrin, Sasaki, and Song introduced a new tool called Boomerang Connectivity Table (BCT) for measuring the resistance of a block cipher against the boo…

cs.IT2019★ 1 cited

Steiner systems and -designs from ternary linear codes of length

Chunming Tang, Cunsheng Ding, Maosheng Xiong

Coding theory and -designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We the…