1 citations · 2 across the 13 of their papers we have counts for
15 papers
The probabilistic bound for perfect hashing is sharp only for binary alphabets
Shitao Li, Minjia Shi
We investigate the optimal asymptotic rate of perfect -hash codes, a fundamental extremal problem in combinatorics, information theory, and computer science. Let $B_q=-\lo…
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…
The weight enumerator polynomials of the lifted codes of the projective Solomon-Stiffler codes
Minjia Shi, Shitao Li, Tor Helleseth
Determining the weight distribution of a code is an old and fundamental topic in coding theory that has been thoroughly studied. In 1977, Helleseth, Kløve, and Mykkeltveit presente…
Characterization of Plotkin-optimal two-weight codes over finite chain rings and related applications
Shitao Li, Minjia Shi
Few-weight codes over finite chain rings are associated with combinatorial objects such as strongly regular graphs (SRGs), strongly walk-regular graphs (SWRGs) and finite geometrie…
Binary self-orthogonal codes which meet the Griesmer bound or have optimal minimum distances
Minjia Shi, Shitao Li, Tor Helleseth +1
The purpose of this paper is two-fold. First, we characterize the existence of binary self-orthogonal codes meeting the Griesmer bound by employing Solomon-Stiffler codes and some…
Optimal quaternary linear codes with one-dimensional Hermitian hull and the related EAQECCs
Shitao Li, Minjia Shi, Huizhou Liu
Linear codes with small hulls over finite fields have been extensively studied due to their practical applications in computational complexity and information protection. In this p…
Characterization and construction of optimal binary linear codes with one-dimensional hull
Shitao Li, Minjia Shi, Jon-Lark Kim
The hull of a linear code over finite fields is the intersection of the code and its dual, and linear codes with small hulls have applications in computational complexity and infor…
Two conjectures on the largest minimum distances of binary self-orthogonal codes with dimension 5
Minjia Shi, Shitao Li, Jon-Lark Kim
The purpose of this paper is to solve the two conjectures on the largest minimum distance of a binary self-orthogonal code proposed by Kim and Choi (IEEE Tran…
Several classes of Galois self-orthogonal MDS codes and related applications
Yang Li, Yunfei Su, Shixin Zhu +2
Let be a prime power and be an integer with . -Galois self-orthogonal codes are generalizations of Euclidean self-orthogonal codes () and Hermi…
Several constructions of optimal LCD codes over small finite fields
Shitao Li, Minjia Shi, Huizhou Liu
Linear complementary dual (LCD) codes are linear codes which intersect their dual codes trivially, which have been of interest and extensively studied due to their practical applic…