论文笔记(Hypergraph Moore Bound)

A Simple and Sharper Proof of the Hypergraph Moore Bound

论文笔记(Minimizing congestion in general networks)

ISIT会议报告(Improved Decoding of Tanner Codes)

We present improved decoding algorithms for expander-based Tanner codes.

组会分享(LDC Lower Bound)

A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation

【题解】USTCPC25 F&K题解

出的两道妙妙题