5 papers · 1 filter
Two-Step Decoding of Binary Sum-Rank-Metric Codes
Hao Wu, Bocong Chen, Guanghui Zhang +1
We address an open problem posed by Chen-Cheng-Qi (IEEE Trans.\ Inf.\ Theory, 2025): can the decoding of binary sum-rank-metric codes $\SR(C_1,C_2)$ with matrix blocks b…
Improved AntiGriesmer Bounds for Linear Anticodes and Applications
Guanghui Zhang, Bocong Chen, Liren Lin +1
This paper improves the antiGriesmer bound for linear anticodes previously established by Chen and Xie (Journal of Algebra, 673 (2025) 304-320). While the original bound required t…
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 (…
Decoding Algorithms for Twisted GRS Codes
Guanghui Zhang, Liren Lin, Bocong Chen
Twisted generalized Reed-Solomon (TGRS) codes were introduced to extend the algebraic capabilities of classical generalized Reed-Solomon (GRS) codes. This extension holds the poten…
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…