A general sequential time-space tradeoff for finding unique elements
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The computational complexity of universal hashing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Linear-time encodable and decodable error-correcting codes
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
Introduction to Coding Theory
Time-space tradeoffs for branching programs
Journal of Computer and System Sciences
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
Determinism versus nondeterminism for linear time RAMs with memory restrictions
Journal of Computer and System Sciences - STOC 1999
A Non-Linear Time Lower Bound for Boolean Branching Programs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A time-space tradeoff for sorting on a general sequential model of computation
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Streaming Computation of Combinatorial Objects
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Endcoding complexity versus minimum distance
IEEE Transactions on Information Theory
| Hi-index | 0.89 |
A time-space tradeoff lower bound for the decoding complexity of asymptotically good error-correcting codes for oblivious write-k-times branching programs is proved. Specifically, we prove that the computation time T and space S of every oblivious write-k-times branching program that decodes an asymptotically good error-correcting code with block length n satisfy SċTk= Ω((n/k)k+1).