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.
A RM-Polar Codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
In this letter we propose a new hybrid code called "RM-Polar" codes. This new codes are constructed by combining the construction of Reed-Muller (RM) code and Polar code. It has much larger minimum Hamming distance than Polar codes, therefore it has much better error performance than Polar codes.
citation-role summary
baseline 1
citation-polarity summary
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 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.