Reed-Muller Codes
From MaRDI portal
Recommendations
Cites work
- A class of low-rate nonlinear binary codes
- A Mathematical Theory of Communication
- A New Upper Bound on the Block Error Probability After Decoding Over the Erasure Channel
- A simple derivation of the coding theorem and some applications
- Algebraic Codes for Data Transmission
- Almost-Reed–Muller Codes Achieve Constant Rates for Random Errors
- Alternating bilinear forms over GF(q)
- An optimum nonlinear code
- An Upper Bound on $\ell_q$ Norms of Noisy Functions
- Analysis of Boolean Functions
- Arikan meets Shannon: polar codes with near-optimal convergence to channel capacity
- Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels
- Bounds on the decoding error probability of binary linear codes via their spectra
- Channel Coding Rate in the Finite Blocklength Regime
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Class of algorithms for decoding block codes with channel measurement information
- Compressed sensing
- Construction of Polar Codes With Sublinear Complexity
- Decoding of Reed-Muller codes with a large number of errors
- Discrete isoperimetric inequalities and the probability of a decoding error
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Efficiently Decoding Reed–Muller Codes From Random Errors
- Error detecting and error correcting codes
- Error-Correction Capability of Binary Linear Codes
- Error-locating pairs for cyclic codes
- Every monotone graph property has a sharp threshold
- Extractors from Reed-Muller codes
- Extrinsic information transfer functions: model and erasure channel properties
- Finite-Length Scaling for Polar Codes
- Fundamentals of Error-Correcting Codes
- General constructions for information-theoretic private information retrieval
- How to Construct Polar Codes
- How to share a secret
- scientific article; zbMATH DE number 3877082 (Why is no real title available?)
- scientific article; zbMATH DE number 4213418 (Why is no real title available?)
- scientific article; zbMATH DE number 5604104 (Why is no real title available?)
- scientific article; zbMATH DE number 3178048 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1250549 (Why is no real title available?)
- scientific article; zbMATH DE number 1456837 (Why is no real title available?)
- scientific article; zbMATH DE number 3213251 (Why is no real title available?)
- scientific article; zbMATH DE number 6541785 (Why is no real title available?)
- Hypothesis testing and information theory
- Influences of variables and threshold intervals under group symmetries
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- IP = PSPACE
- List Decoding of Polar Codes
- Locally decodable codes
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Lower bounds to error probability for coding on discrete memoryless channels. I
- Maxwell Construction: The Hidden Bridge Between Iterative and Maximuma PosterioriDecoding
- Moderate Deviations in Channel Coding
- Modern Coding Theory
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- New generalizations of the Reed-Muller codes--I: Primitive codes
- Noise sensitivity of Boolean functions and applications to percolation
- On codes decoding a constant fraction of errors on the BSC
- On decoding by error location and dependent sets of error positions
- On the performance of Reed-Muller codes with respect to random errors and erasures
- On the strong converse of the coding theorem for symmetric channels without memory
- On the weight enumeration of weights less than 2.5d of Reed—Muller codes
- On the weight structure of Reed-Muller codes
- Optimal soft decision block decoders based on fast Hadamard transform
- Optimal testing of multivariate polynomials over small prime fields
- Polar Codes: Speed of Polarization and Polynomial Gap to Capacity
- Polar Codes’ Simplicity, Random Codes’ Durability
- Polarization and polar codes
- Private information retrieval
- Probability and Computing
- Proof verification and the hardness of approximation problems
- Pseudorandom bits for polynomials
- Random codes: minimum distances and error exponents
- Random coding techniques for nonrandom codes
- Random low-degree polynomials are hard to approximate
- Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization
- Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
- Recursive Projection-Aggregation Decoding of Reed-Muller Codes
- Reed-Muller codes achieve capacity on erasure channels
- Reed-Muller sensing matrices and the LASSO (invited paper)
- Reed–Muller Codes Achieve Capacity on Erasure Channels
- Reed–Muller Codes for Random Erasures and Errors
- Reed–Muller Codes: Theory and Algorithms
- Restricted Isometry Property of Random Subdictionaries
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Self-testing/correcting with applications to numerical problems
- Soft-decision decoding of Reed-Muller codes: a simplified algorithm
- Soft-decision decoding of Reed-Muller codes: recursive lists
- Stable signal recovery from incomplete and inaccurate measurements
- Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields
- Testing low-degree polynomials over prime fields
- Testing Polynomials over General Fields
- Testing Reed–Muller Codes
- The coding of messages subject to chance errors
- The random coding bound is tight for the average code (Corresp.)
- The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Threshold for monotone symmetric properties through a logarithmic Sobolev inequality
- Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors
- Universal Polarization
- Weight Distribution and List-Decoding Size of Reed–Muller Codes
- Weight enumerator for second-order Reed-Muller codes
Cited in
(20)- Redundancies of correction capability optimized Reed-Muller codes
- On Reed-Solomon codes
- Extractors from Reed-Muller codes
- Binary Reed-Muller codes and Hamming spheres
- Reed-Muller codes for random erasures and errors
- Quaternary Reed–Muller Codes
- scientific article; zbMATH DE number 5529972 (Why is no real title available?)
- Projective Reed-Muller codes
- Binary multilevel coset codes based on Reed-Muller codes
- scientific article; zbMATH DE number 2081117 (Why is no real title available?)
- On the performance of Reed-Muller codes with respect to random errors and erasures
- Skew Reed-Muller codes
- scientific article; zbMATH DE number 969093 (Why is no real title available?)
- Error-correction capability of Reed-Muller codes
- Distance Verification for Classical and Quantum LDPC Codes
- Boolean Algebras in Electric Circuit Design
- Coxeter codes: extending the Reed-Muller family
- On the parameters of a McEliece-type cryptosystem on D-codes based on binary Reed-Muller codes
- A criterion for decoding on the binary symmetric channel
- Duals of multiplicity codes
This page was built for publication: Reed-Muller Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5870775)
