97 citations · 198 across the 33 of their papers we have counts for
33 papers
New Bounds for Linear Codes with Applications
Liren Lin, Guanghui Zhang, Bocong Chen +1
Bounds on linear codes play a central role in coding theory, as they capture the fundamental trade-off between error-correction capability (minimum distance) and information rate (…
Improved upper bounds on the number of non-zero weights of cyclic codes
Bocong Chen, Yuqing Fu, Hongwei Liu
Let C be an arbitrary simple-root cyclic code and let G be the subgroup of Aut(C) (the automorphism group of C) generated by the multiplier, the cyclic shift and the scalar multipl…
Constructions of Constant Dimension Subspace Codes
Yun Li, Hongwei Liu, Sihem Mesnager
Subspace codes have important applications in random network coding. It is interesting to construct subspace codes with both sizes, and the minimum distances are as large as possib…
Linear Codes from Simplicial Complexes over
Hongwei Liu, Zihao Yu
In this article we mainly study linear codes over and their binary subfield codes. We construct linear codes over whose defining sets are the…
New Constructions of Optimal Binary LCD Codes
Guodong Wang, Shengwei Liu, Hongwei Liu
Linear complementary dual (LCD) codes can provide an optimum linear coding solution for the two-user binary adder channel. LCD codes also can be used to against side-channel attack…
A class of constacyclic codes are generalized Reed-Solomon codes
Hongwei Liu, Shengwei Liu
Maximum distance separable (MDS) codes are optimal in the sense that the minimum distance cannot be improved for a given length and code size. The most prominent MDS codes are gene…