On traceability property of equidistant codes

Necessary and Sufficient conditions for an equidistant code to be a 2-TA code are obtained. An explicit construction method is proposed to obtain linear MDS [p+1,2,p] codes over the finite field Fp, where p is a prime. These codes can be used as 2-TA codes for p>2. In particular, for p=3, it is observed that the linear [4, 2, 3] MDS code contradicts a result of Jin and Blaum (2007). The correct version of this result and its proof is given. Existence of some infinite families of equidistant 2-TA codes is shown by using Jacobsthal and Hadamard matrices. Some of these codes are also observed to be good equidistant code (Sinha et al., 2008).