4 citations · 6 across the 5 of their papers we have counts for
5 papers
Linear Codes over and Reaching the Griesmer Bound
Jin Li, Aixian Zhang, Keqin Feng
We construct two series of linear codes over finite ring and Galois ring respectively reaching the Griesmer bound. They derive two series of c…
Construction of Cyclic and Constacyclic Codes for b-symbol Read Channels Meeting the Plotkin-like Bound
Minghui Yang, Jin Li, Keqin Feng
The symbol-pair codes over finite fields have been raised for symbol-pair read channels and motivated by application of high-density data storage technologies [1, 2]. Their general…
Linear Codes over Galois Ring Related to Gauss sums
Aixian Zhang, Jin Li, Keqin Feng
Linear codes over finite rings become one of hot topics in coding theory after Hommons et al.([4], 1994) discovered that several remarkable nonlinear binary codes with some linear-…
Generalized Hamming Weights of Irreducible Cyclic Codes
Minghui Yang, Jin Li, Keqin Feng +1
The generalized Hamming weight (GHW) of linear codes is a natural generalization of the minimum Hamming distance and has become one of important resear…
Large Even Number Represent The Sum Of Odd Primes
Jin Li
In this paper, I proved that where is a large even number, and are odd primes.