3 problems

0 votes0 replies0 views
Chakraborty–Radhakrishnan–Raghunathan–Sasatte conjecture on zero-error list-decoding bounds
Chakraborty–Radhakrishnan–Raghunathan–Sasatte conjecture. (a) For all constants $c>0$ , there is a constant $\alpha$ such that, for all sufficiently large $m$ ,
Conjectureopeninformation-theory list-decoding zero-error-codingarXiv posted 2 days ago
0 votes0 replies0 views
Conjecture on the necessity of non-singleton zero-error wiretap codes
Let $(\mathbf T_B,\mathbf T_C)$ be an uncertain wiretap channel, and let $C_0(\mathbf T_B,\mathbf T_C)$ denote its zero-error wiretap capacity. A non-singleton zero-error code is a…
Conjectureopeninformation-theory wiretap-channels zero-error-codingarXiv posted 2 days ago
0 votes0 replies0 views
The conjecture that zero-error capacity is approximately the time-sharing bound
Zero-error time-sharing conjecture. The bounds obtained partially support the conjecture that
Conjectureopeninformation-theory interference-channels zero-error-codingarXiv posted 2 days ago

Chakraborty–Radhakrishnan–Raghunathan–Sasatte conjecture on zero-error list-decoding bounds