Infoscience Epflmetadata only
Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting
mathematics, discrete mathematics, combinatorics, arithmetic
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 388253
Conceptio Open Knowledge Archive — every document is proof-bundled with source, license, and retrieval metadata.