A DECODING ALGORITHM FOR THE (23,12,7)GOLAY-CODE WITH ERROR AND ERASURE CORRECTION

The problem of complete decoding the binary Golay code over error-and- erasure memoryless channels is addressed. An algebraic description of the erasure channel is given and a nearest neighbor decoding scheme is defined, This decoding scheme is viewed as a standard array decoding by suitably partitioning the set of received words. The analysis of th is partition leads to the study of punctured Golay codes and the prope rties of their cosets, Based on these properties, a complete algebraic decoding algorithm is provided which simultaneously corrects errors a nd erasures.