1 problem

0 votes0 replies0 views
Optimal code length conjecture for complete consecutive PICOD $(t)$ problems
Let $m$ be the number of messages and let $t$ be a positive integer. For integers $s_{\min}$ and $s_{\max}$ satisfying … consider the complete-- $[s_{\min}:s_{\max}]$ PICOD $(t)$ pro…
Conjectureopenbroadcast-coding index-coding information-theoryarXiv posted 2 days ago

Optimal code length conjecture for complete consecutive PICOD(t)(t)(t) problems