A NEW DECODING ALGORITHM FOR COMPLETE DECODING OF LINEAR BLOCK-CODES

In this paper we present and describe an improved version of the Zero- Neighbors algorithm, which we call the Zero-Coverings algorithm. We al so present a method for finding a smallest subset of codewords ( Zero- Coverings) which need to be stored to perform the Zero-Coverings algor ithm. For some short codes, the sizes of Zero-Coverings are obtained b y computer searches; for long codes, an asymptotic bound on the sizes of such subsets is also given.