BiD codes, built from a 3x3 Kronecker kernel, have proven minimum distance growing at least as N^0.543 at any fixed rate, faster than Reed-Muller's N^0.5.
Reed–Muller codes: Theory and algorithms,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
BiD Codes: Algebraic Codes from $3 \times 3$ Kernel
BiD codes, built from a 3x3 Kronecker kernel, have proven minimum distance growing at least as N^0.543 at any fixed rate, faster than Reed-Muller's N^0.5.