output
20052026
most citedLAMOST Experiment for Galactic Understanding and Exploration (LEGUE) The survey science plan

553 citations

Showing 2019 · cs.ITShow all

6 papers · 2 filters

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

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

Combinatorial t-designs from quadratic functions

Can Xiang, Xin Ling, Qi Wang

Combinatorial -designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials m…

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…

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.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…