Abstract — The (24, 12, 8) extended binary Golay code is a well-known rate-1/2 short block-length linear error- correcting code with remarkable properties. This paper investigates the design of an efficient low-complexity soft-decision decoding architecture for this code.

Our decoding process will consist of making 12 so-called decoding checks -- one for each face of the dodecahedron. We will say a decoding check fails if the result is 1, and that it passes if the result is 0.

Jun 1, 2013 · This paper proposes an efficient high-speed TLDA called message-syndrome decoding algorithm (MSDA) by using the message syndrome to correct the binary systematic Golay code. The proposed MSDA is based on the novel message-syndrome lookup table (MSLT).

We demonstrate a method for encoding and decoding the [24,12,8] extended binary Golay code using a simple apparatus. We also present several generalizations of this construction which admit similar decoding algorithms.

Recently, some table-lookup decoding algorithms (TLDAs) have been used to correct the binary Golay code. This paper proposes an efficient high-speed TLDA called message-syndrome decoding algorithm(MSDA) by using the message syndrome to …

We introduce exceptionally simple decoding algorithms for the two extended Golay codes. The algorithms are based on recent methods of Conway and Curtis of finding the unique blocks containing five points in either the (5,8,24)Steiner system or the (5,6,12)Steiner system.

We present a simple combinatorial decoding algorithm for the [23,12,7] Golay code. The decoding algorithm is based on the "design" properties of the sets corresponding to the parity check matrix. The decoding of the Golay code is reduced to a set of boolean equations and can be easily done by hand. 1 Introduction

Abstract: An efficient high-speed encoding scheme of binary Golay code (23, 12, 7) along with its design and implementation in Spartan-6 FPGA is presented in this paper. For the proposed encoder, a low latency is achieved by excluding linear …

In an automated algorithm implementing the decoding scheme we have discussed, we would need to fully enumerate the possible patterns of decoding check failures. There are 39 in total -- since four of the nine patterns we have looked at can be modified in several ways.

Aug 14, 1997 · A decoding algorithm based on revised syndromes to decode the binary (23, 12, 7) Golay code is presented. The algorithm strongly depends on the algebraic properties of the code.