Bounded-Degree Low-Rank Parity-Check (BD-LRPC) Codes

For BD-LRPC codes, their parity-check matrices choose elements from a special subspace V generated by $1, a, ...,a^{d-1}$ in $GF(q^m)$. More info. about BD_LRPC can be found at https://arxiv.org/abs/2401.15195.

Below are Magma implementations of the proposed decodings of BD-LRPC codes.

• Experiments on Successful Expansions
• Error Support Recovery