A note on the decoding complexity of error-correcting codes
type: Item
instance of: scholarly article
title: A note on the decoding complexity of error-correcting codes
zbMATH Open document ID: 1189.94057
author: André Gronemeier
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 94B35
Mathematics Subject Classification ID: 94B50
Mathematics Subject Classification ID: 68Q99
zbMATH DE Number: 5664702
zbMATH Keywords: computational complexity
zbMATH Keywords: branching programs
zbMATH Keywords: error-correcting codes
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.06.006
OpenAlex ID: W2064548203
cites work: Determinism versus nondeterminism for linear time RAMs with memory restrictions
cites work: Endcoding Complexity Versus Minimum Distance
cites work: Time-space tradeoffs for branching programs
cites work: Time-space trade-off lower bounds for randomized computation of decision problems
cites work: A time-space tradeoff for sorting on non-oblivious machines
cites work: The computational complexity of universal hashing
cites work: A Mathematical Theory of Communication
cites work: Q4234087
cites work: Q3946078
cites work: Branching Programs and Binary Decision Diagrams
cites work: Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer
DOI: 10.1016/J.IPL.2006.06.006
description: scientific article; zbMATH DE number 5664702