Showing cs.ITShow all
2 papers · 1 filter
cs.IT2026
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 the…
cs.IT2023
On non-expandable cross-bifix-free codes
Chunyan Qin, Bocong Chen, Gaojun Luo
A cross-bifix-free code of length over is defined as a non-empty subset of satisfying that the prefix set of each codeword is disjoint from the…