By Stefano Della Fiore and Marco Dalai

We derive a simple proof, based on information theoretic inequalities, of an upper bound on the largest rates of *q*-ary *\overline{2}*-separable codes that improves recent results of Wang for any *q\geq 13*. For the case *q=2*, we recover a result of Lindstr\"om, but with a much simpler derivation. The method... Show more

June 24, 2021

Loading full text...

Similar articles

Loading recommendations...

x1

A note on $\overline{2}$-separable codes and $B_2$ codes

Click on play to start listening