Year: 2019
Type: preprint
Abstract: Rudolph (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. Peterson and Weldon (1972) extended Rudolphs algorithm to a two-step majority logic decoder correcting the same number of errors than Reed's celebrated multi-step majority logic decoder. 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.
Source: arXiv (Cornell University)
Authors: Cruz, Romar dela, Wassermann, Alfred
Institution: University of the Philippines Diliman
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4286663027