A criterion for decoding on the binary symmetric channel
From MaRDI portal
Cites work
- A Mathematical Theory of Communication
- A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels
- Almost-Reed–Muller Codes Achieve Constant Rates for Random Errors
- An Upper Bound on $\ell_q$ Norms of Noisy Functions
- Bounds on spectra of codes with known dual distance
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Combinatorial bounds for list decoding
- Concentration inequalities. A nonasymptotic theory of independence
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Folded codes from function field towers and improved optimal rate list decoding
- Generic Reed-Solomon codes achieve list-decoding capacity
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1559530 (Why is no real title available?)
- scientific article; zbMATH DE number 3014822 (Why is no real title available?)
- Hypercontractivity of Spherical Averages in Hamming Space
- Improved list-decodability of random linear binary codes
- Influences of variables and threshold intervals under group symmetries
- LDPC codes achieve list decoding capacity
- List-decoding multiplicity codes
- Local list recovery of high-rate tensor codes \& applications
- On codes decoding a constant fraction of errors on the BSC
- On relations between covering radius and dual distance
- On Russo's approximate zero-one law
- On the accuracy of the binomial approximation to the distance distribution of codes
- On the bias of Reed-Muller codes over odd prime fields
- On the distance distribution of codes
- On the List-Decodability of Random Linear Codes
- On the performance of Reed-Muller codes with respect to random errors and erasures
- On the weight enumeration of weights less than 2.5d of Reed—Muller codes
- On the weight structure of Reed-Muller codes
- POINT DISTRIBUTIONS IN TWO‐POINT HOMOGENEOUS SPACES
- Random low-degree polynomials are hard to approximate
- Reed-Muller Codes
- Reed-Muller codes achieve capacity on erasure channels
- Reed-Muller codes on BMS channels achieve vanishing bit-error probability for all rates below capacity
- Reed-Muller codes polarize
- Reed–Muller Codes for Random Erasures and Errors
- Reed–Muller Codes: Theory and Algorithms
- Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
- STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES
- Strong asymptotics for Krawtchouk polynomials
- Survey of binary Krawtchouk polynomials
- The Stolarsky principle and energy optimization on the sphere
- Weight Distribution and List-Decoding Size of Reed–Muller Codes
- Weight enumerator for second-order Reed-Muller codes
This page was built for publication: A criterion for decoding on the binary symmetric channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7026842)
