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 also present a method for finding a smallest subset of codewords ( Zero-Coverings) which need to be stored to perform the Zero-Coverings algorithm. For some short codes, the sizes of Zero-Coverings are obtained by computer searches; for long codes, an asymptotic bound on the sizes of such subsets is also given. Key words. coding, decoding, linear codes, block codes AMS subject classifications. 94B35, 94B05 PII. S0895480197323974

• Type: Journal
• Year: 1998
• Where: SIAMDM
• Authors: Yunghsiang S. Han
• Keywords: Algorithm, Improved Version, SIAMDM 1998, Smallest Subset