2 papers
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 t…
math.CO2026
A Matching-Number Refinement of Brouwer's Laplacian Eigenvalue Inequality
Jing Huang, Chunyan Qin
Let be a finite simple graph with Laplacian eigenvalues , and define \[ \eps_k(G)= \sum_{j=1}^{\min\{k,|V|\}}λ_j(L(G))-|E|. \] Let…