2 problems

Consider the index codes studied in the decoding strategy based solely on soft information from the decoded index, with performance measured by the mutual information rate…

Let $C\subset\{0,1\}^N$ be a code with … where $\operatorname{LCS}(C)$ denotes the maximum longest common subsequence length between two distinct codewords in $C$ and $\delta_0$ is…