On a complete decoding scheme for binary radical codes (Q1202442)

Let \(C\) be a linear code over a field \(K\). It is well-known that \(C\) has minimum distance of at least \(J+1\) if at each stage of majority logic decoding a set of at least \(J\) check sums can be formed, orthogonal on a check sum used in the next stage. If \(J\) denotes the largest such number then \(J+1\) is called the majority-decodable distance of \(C\). If the true minimum distance of \(C\) equals the majority-decodable distance then \(C\) is called completely majority-logic decodable. Let \(G\) be a finite group and \(KG\) a group algebra, extended to a \(K\)-algebra. The subspaces of \(KG\) can be viewed as linear codes in \(K^ n\). The augmentation ideal \(I(K,G)\) of \(KG\) is defined by \(I(K,G)=\bigl\{\sum_{g\in G}k_ g g\mid\sum_{g\in G} k_ g=0\bigr\}\). \(I(K,G)\) has the basis \(\{g-1\mid g\in G\), \(g\neq 1\}\). Now let \(G\) be a finite 2-group of order \(2^ n\) and let \(K\) be a finite field of characteristic 2. Then the augmentation ideal \(I(K,G)\) equals the Jacobson radical of \(KG\). The powers of the Jacobson radical are called the radical codes of \(KG\). It is shown here, by a constructive procedure, that for every 2-group \(G\), all radical codes in \(GF(2)G\) can be completely decoded by a multi-step majority- logic decoder.