One-step Majority-logic Decoding with Subspace Designs

07/07/2019

∙

by   Alfred Wassermann, et al.

∙

0

∙

share

Rudoph (1967) introduced one-step majority logic decoding for linear codes derived from combinatorial designs. The decoder is easily realizable in hardware and requires that the dual code has to contain the blocks of so called geometric designs as codewords. Here, we study the codes from subspace designs. It turns out that these codes have the same majority logic decoding capability as the codes from geometric designs, but their majority logic decoding complexity is sometimes drastically improved.