On a Sufficient Condition to Attain Minimum Square Distance in Euclidean Codes

Abstract

In this paper, we first obtain a sufficient condition for a linear code to have minimum square Euclidean distance at least d2. Using this condition, we then obtain a sufficient lower bound for random error correction and a bound on the maximum dimension k of Euclidean codes having minimum square distance at least d2.