Local-Testability and Self-Correctability of q-ary Sparse Linear Codes

Details Local-Testability and Self-Correctability of q-ary Sparse Linear Codes Local-Testability and Self-Correctability of q-ary Sparse Linear Codes

2010-12-16

arxiv.org/abs/1012.3506v1

Computer Science

Computational Complexity

Scientific paper

We prove that q-ary sparse codes with small bias are self-correctable and locally testable. We generalize a result of Kaufman and Sudan that proves the local testability and correctability of binary sparse codes with small bias. We use properties of q-ary Krawtchouk polynomials and the McWilliams identity -that relates the weight distribution of a code to the weight distribution of its dual- to derive bounds on the error probability of the randomized tester and self-corrector we are analyzing.

Affiliated with

Also associated with

No associations

Rating

Local-Testability and Self-Correctability of q-ary Sparse Linear Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Local-Testability and Self-Correctability of q-ary Sparse Linear Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local-Testability and Self-Correctability of q-ary Sparse Linear Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-218352