1 citations · 1 across the 10 of their papers we have counts for
11 papers
Norm-One Torus Decompositions and Decoding of Gashkov-Sidel'nikov Codes
Minjia Shi, Shitao Li, Yuhong Xia +2
Let , let , and let \[\mathcal T=\{x\in K^*:\operatorname{N}_{K/\mathbb F_q}(x)=1\}.\] For both cyclic and constacyclic Gashkov-Sidel'nikov codes, we show…
Lower Bounds for Error Coefficients of Griesmer Optimal Linear Codes via Iteration
Chaofeng Guan, Shitao Li, Gaojun Luo +2
The error coefficient of a linear code is defined as the number of minimum-weight codewords. In an additive white Gaussian noise channel, optimal linear codes with the smallest err…
Determining the covering radius of all generalized Zetterberg codes in odd characteristic
Minjia Shi, Shitao Li, Tor Helleseth +1
For an integer , let be the generalized Zetterberg code of length over the finite field $\F_{q_0}$ of odd characteristic. Recently, Shi, Hell…
A further study on the mass formula for linear codes with prescribed hull dimension
Shitao Li, Minjia Shi, Yang Li +1
Finding a mass formula for a given class of linear codes is a fundamental problem in combinatorics and coding theory. In this paper, we consider the action of the unitary (resp. sy…
Some bounds on the cardinality of the -symbol weight spectrum of codes
Hongwei Zhu, Shitao Li, Minjia Shi +2
The size of the Hamming distance spectrum of a code has received great attention in recent research. The main objective of this paper is to extend these significant theories to the…
An open problem and a conjecture on binary linear complementary pairs of codes
Shitao Li, Minjia Shi, San Ling
The existence of -ary linear complementary pairs (LCPs) of codes with has been completely characterized so far. This paper gives a characterization for the existence of b…