The Constructions of the minimum l-defeasible set
Zhou Jing-zhi · Journal of Shandong University · 2008
To maximize the squared error-correction radius(SECR) of a Chase-like decoding algorithm, the constructions for the l-defeasible set were given according to the definition of the l-defeasibleset and some decision conditions,by investigating the center vectors of spheres of radius l which cover all the vectors of length 2l+2, namely the search centers of Chase-like decoding algorithms.