1 citations · 3 across the 6 of their papers we have counts for
6 papers
The automorphism groups of random linear codes
Xiaoru Li, Qi Wang, Yue Zhou
The matching codewords framework is a key tool in recent algorithms for solving the Linear Code Equivalence (LCE) problem and in security analyses of LCE-based cryptographic scheme…
Two families of linear codes with desirable properties from some functions over finite fields
Ziling Heng, Xiaoru Li, Yansheng Wu +1
Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes w…
Self-orthogonal codes from -divisible codes
Xiaoru Li, Ziling Heng
Self-orthogonal codes are an important subclass of linear codes which have nice applications in quantum codes and lattices. It is known that a binary linear code is self-orthogonal…
Constructions of cyclic codes and extended primitive cyclic codes with their applications
Ziling Heng, Xinran Wang, Xiaoru Li
Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construc…
A construction of optimal locally recoverable codes
Xiaoru Li, Ziling Heng
Locally recoverable codes are widely used in distributed and cloud storage systems. The objective of this paper is to present a construction of near MDS codes with oval polynomials…
Constructions of near MDS codes which are optimal locally recoverable codes
Xiaoru Li, Ziling Heng
A linear code with parameters is said to be almost maximum distance separable (AMDS for short). An AMDS code whose dual is also AMDS is referred to as an near maximum d…