A note on the decoding complexity of error-correcting codes
From MaRDI portal
Publication:845843
DOI10.1016/J.IPL.2006.06.006zbMATH Open1189.94057OpenAlexW2064548203MaRDI QIDQ845843FDOQ845843
Authors: André Gronemeier 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.006
Recommendations
Cites Work
- A Mathematical Theory of Communication
- Title not available (Why is that?)
- Branching Programs and Binary Decision Diagrams
- The computational complexity of universal hashing
- Title not available (Why is that?)
- Time-space tradeoffs for branching programs
- Determinism versus nondeterminism for linear time RAMs with memory restrictions
- Time-space trade-off lower bounds for randomized computation of decision problems
- A time-space tradeoff for sorting on non-oblivious machines
- Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer
- Endcoding Complexity Versus Minimum Distance
Cited In (6)
- The complexity of error-correcting codes
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- On decoding by error location and dependent sets of error positions
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
- A note on tailbiting codes and their feedback encoders
- Bounded independence plus noise fools products
This page was built for publication: A note on the decoding complexity of error-correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845843)
