2013/04/23 by Sihn, Myong-Son, Kim, Ryul
#Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.1304.6161
In this paper we investigate the separation properties and related bounds of some codes. We tried to obtain a new existence result for (w1, w2)-separating codes and discuss the "optimality" of the upper bounds. Next we tried to study some interesting relationship between separation and existence of non-trivial subspace subcodes for Reed-Solomon codes.