1 problem

Let $\ell$ be the secret message size, let $n$ be the network dimension, let $t$ be the security parameter, and let $e$ be the number of list-decodable rank errors for which the li…