搜索结果: 1-2 共查到“信息论 Strong”相关记录2条 . 查询时间(0.143 秒)
Combinatorial limitations of a strong form of list decoding
Combinatorial limitations strong form of list decoding combinatorics
2012/2/29
We prove the following results concerning the combinatorics of list decoding, motivated by the exponential gap between the known upper bound (of $O(1/\gamma)$) and lower bound (of $\Omega_p(\log (1/\g...
In 1990, Bondy posed the small circuit double cover (SCDC) conjecture: Every $2$-connected graph has a circuit double cover (CDC) with the number of circuits less than $|V|$ (the order of the vertex s...