Deterministic Approximation Algorithms for the Nearest Codeword Problem

Keyphrases

• Deterministic Approximation 100%
• Nearest Codeword Problem 100%
• Approximation Algorithms 57%
• Remote Point 57%
• Approximation Ratio 28%
• Deterministic Algorithm 28%
• Linear Space 28%
• Log-log 14%
• Error Correction Codes 14%
• NP-hard 14%
• Polynomial Time 14%
• Log 2 14%
• Polynomial-time Algorithm 14%
• Randomized Algorithms 14%
• Hamming Distance 14%
• Error Theory 14%
• Efficient Approximation Algorithm 14%
• Matrix Rigidity 14%
• Circuit Lower Bounds 14%
• Computational Complexity Theory 14%

Mathematics

• Remote Point 100%
• Polynomial Time 50%
• Linear Space 50%
• Minimizes 25%
• Hamming Distance 25%
• Arbitrary Constant 25%
• Rigidity Matrix 25%
• Theory of Error-Correcting Codes 25%