LAUSR

Separable codes and $B_{2}$ codes are combinatorial structures which could be applied to identify traitors in multimedia fingerprinting and to uniquely decode messages in multiple access communication respectively. In this letter we provide new lower and upper bounds for the largest code rates of $q$ -ary separable codes and $B_{2}$ codes, which improve the existing results when the alphabet size $q$ is relatively small.