Sufficient conditions for interval properness of linear error detecting codes
Rossitza Dodunekova, Li Weng
Abstract
Properness of a linear error detecting code is a property which in a certain sense makes the code more appropriate for error detection over a symmetric memoryless channel than a non-proper one.This property is related to the undetected error probability of the code, which is a function of the channel symbol error probability, involving the code weight distribution.However, relatively few codes are known with their weight distribution.It is therefore useful to have criteria for properness which do not depend on the code weight distribution.Here we give sufficient conditions for interval properness of a q-ary linear error detecting code, which only involve the code length and the dual code distance.In case of binary codes our criterion reduces to a criterion known earlier.We also give examples, mostly on parametric classes of Griesmer codes, where intervals of properness have been found by help of the new criterion.It turns out that when the dimension of the Griesmer codes under consideration increases the intervals of properness converge to (0, (q -1)/q], i.e., the codes are asymptotically proper.