Abstract: We show that it is possible to break up Higher Grassmann codes we constructed in earlier work to a sequence of affine Reed-Muller codes so that various operations can be reduced to ...
Abstract: This article proposes a novel low-complexity syndrome-based linear programming (SB-LP) decoding algorithm for decoding quantum low-density parity-check codes. Under the code-capacity model, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback