Recursive error correction for general Reed--Muller codes
From MaRDI portal
Publication:2489920
DOI10.1016/J.DAM.2005.05.013zbMATH Open1091.94043OpenAlexW1991539936MaRDI QIDQ2489920FDOQ2489920
Authors: I. I. Dumer, Kirill Shabunov 
Publication date: 28 April 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.013
Recommendations
- Error-correction capability of Reed-Muller codes
- Reed-Muller codes for random erasures and errors
- Reed–Muller Codes for Random Erasures and Errors
- Error Exponents for Recursive Decoding of Reed–Muller Codes on a Binary-Symmetric Channel
- Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
- Efficiently decoding Reed-Muller codes from random errors
- Efficiently Decoding Reed–Muller Codes From Random Errors
- Decoding of Reed-Muller codes with a large number of errors
- On generalized ReedMuller codes and their relatives
- Redundancies of correction capability optimized Reed-Muller codes
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
- Decoding of Reed-Muller codes with a large number of errors
- Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes
- Soft-decision majority decoding of Reed-Muller codes
Cited In (11)
- Title not available (Why is that?)
- Reinforcement learning for optimal error correction of toric codes
- List-decoding Barnes-Wall lattices
- Error-correction capability of Reed-Muller codes
- Title not available (Why is that?)
- On a recursive algorithm of decoding some subsets of the first-order Reed-Muller codes
- Reed–Muller Codes for Random Erasures and Errors
- Reed-Muller Codes
- Using Reed–Muller ${\hbox{RM}}\,(1, m)$ Codes Over Channels With Synchronization and Substitution Errors
- Error Exponents for Recursive Decoding of Reed–Muller Codes on a Binary-Symmetric Channel
- Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
This page was built for publication: Recursive error correction for general Reed--Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489920)
