On the performance of the ternary [13, 7, 5] quadratic-residue code

We investigate the weight structure and error-correcting performance of the ternary [13, 7, 5] quadratic-residue code. It is shown that the covering radius of the code is equal to three and it is t-proper for error correction for any t=0, 1, 2. Two decoding algorithms are suggested.