5 papers
A Griesmer-Type Bound for List-Decodable Linear Codes
Shengwei Liu, Chunyan Qin
A code is -list-decodable if every Hamming ball of radius contains at most codewords of . Here is the list-decoding radius, and is t…
Construction of non-generalized Reed-Solomon MDS codes based on systematic generator matrix
Shengwei Liu, Hongwei Liu, Bocong Chen
Maximum distance separable (MDS) codes are considered optimal because the minimum distance cannot be improved for a given length and code size. The most prominent MDS codes are lik…
About the Rankin and Bergé-Martinet Constants from a Coding Theory View Point
Frédérique Oggier, Shengwei Liu, Hongwei Liu
The Rankin constant measures the largest volume of the densest sublattice of rank of a lattice $Î\in \RR^n$ over all such lattices of rank . The Bergé-Martinet…
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…
Constructions of non-Generalized Reed-Solomon MDS codes
Shengwei Liu, Hongwei Liu, Frederique Oggier
Generalized Reed-Solomon codes form the most prominent class of maximum distance separable (MDS) codes, codes that are optimal in the sense that their minimum distance cannot be im…