Sciweavers

21 search results - page 3 / 5
» Local Decoding and Testing for Homomorphisms
Sort
View
PROPERTYTESTING
2010
14 years 7 months ago
Short Locally Testable Codes and Proofs: A Survey in Two Parts
We survey known results regarding locally testable codes and locally testable proofs (known as PCPs), with emphasis on the length of these constructs. Local testability refers to a...
Oded Goldreich
DELTA
2006
IEEE
15 years 1 months ago
Implementation of Four Real-Time Software Defined Receivers and a Space-Time Decoder using Xilinx Virtex 2 Pro Field Programmabl
This paper describes the concept, architecture, development and demonstration of a real time, high performance, software defined 4-receiver system and a space time decoder to be i...
Peter J. Green, Desmond P. Taylor
FOCS
2010
IEEE
14 years 7 months ago
A Fourier-Analytic Approach to Reed-Muller Decoding
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
Parikshit Gopalan
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
15 years 3 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
ACL
2007
14 years 11 months ago
Chinese Segmentation with a Word-Based Perceptron Algorithm
Standard approaches to Chinese word segmentation treat the problem as a tagging task, assigning labels to the characters in the sequence indicating whether the character marks a w...
Yue Zhang 0004, Stephen Clark