A note on the decoding complexity of error-correcting codes

DOI10.1016/J.IPL.2006.06.006MaRDI QIDQ845843zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational complexityerror-correcting codesbranching programs

Mathematics Subject Classification ID

Decoding (94B35) Synchronization error-correcting codes (94B50) Theory of computing (68Q99)

Recommendations

• Endcoding Complexity Versus Minimum Distance
• The complexity of error-correcting codes
• Linear-time encodable and decodable error-correcting codes
• scientific article; zbMATH DE number 3559420
• On the efficiency of local decoding procedures for error-correcting codes

Cites work

• scientific article; zbMATH DE number 3763833 (Why is no real title available?)
• scientific article; zbMATH DE number 1263215 (Why is no real title available?)
• A Mathematical Theory of Communication
• A time-space tradeoff for sorting on non-oblivious machines
• Branching Programs and Binary Decision Diagrams
• Determinism versus nondeterminism for linear time RAMs with memory restrictions
• Endcoding Complexity Versus Minimum Distance
• The computational complexity of universal hashing
• Time-space trade-off lower bounds for randomized computation of decision problems
• Time-space tradeoffs for branching programs
• Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer

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)