Advertisement

Abstract

Locally decodable codes (LDCs) have played a central role in many recent results in theoretical computer science. The role of finite fields, and in particular, low-degree polynomials over finite fields, in the construction of these objects is well studied. However the role of group homomorphisms in the construction of such codes is not as widely studied. Here we initiate a systematic study of local decoding of codes based on group homomorphisms. We give an efficient list decoder for the class of homomorphisms from any abelian group G to a fixed abelian group H. The running time of this algorithm is bounded by a polynomial in log|G| and an agreement parameter, where the degree of the polynomial depends on H. Central to this algorithmic result is a combinatorial result bounding the number of homomorphisms that have large agreement with any function from G to H. Our results give a new generalization of the classical work of Goldreich and Levin, and give new abstractions of the list decoder of Sudan, Trevisan and Vadhan. As a by-product we also derive a simple(r) proof of the local testability (beyond the Blum-Luby-Rubinfeld bounds) of homomorphisms mapping \({\mathbb{Z}}_p^n\) to ℤ p , first shown by M. Kiwi.

Keywords

Abelian Group Group Homomorphism Oracle Access Decodable Code List Decoder 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ben-Or, M., Coppersmith, D., Luby, M., Rubinfeld, R.: Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122. Springer, Heidelberg (2004)Google Scholar
  2. 2.
    Bellare, M., Coppersmith, D., Håstad, J., Kiwi, M., Sudan, M.: Linearity testing over characteristic two. IEEE Transactions on Information Theory 42(6), 1781–1795 (1996)MATHCrossRefGoogle Scholar
  3. 3.
    Blum, M., Luby, M., Rubinfeld, R.: Self-Testing/Correcting with Applications to Numerical Problems. Journal of Computer and System Sciences 47(3), 549–595 (1993)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 25–32 (1989)Google Scholar
  5. 5.
    Goldreich, O., Rubinfeld, R., Sudan, M.: Learning polynomials with queries: The highly noisy case. SIAM Journal on Discrete Mathematics 13(4), 535–570 (2000)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Guruswami, V., Sudan, M.: List decoding algorithms for certain concatenated codes. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 181–190 (2000)Google Scholar
  7. 7.
    Kiwi, M., Magniez, F., Santha, M.: Exact and approximate testing/correcting of algebraic functions: A survey. In: Khosrovshahi, G.B., Shokoufandeh, A., Shokrollahi, M.A. (eds.) Theoretical Aspects of Computer Science 2000. LNCS, vol. 2292, pp. 30–83. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Kiwi, M.: Testing and weight distributions of dual codes. Theoretical Computer Science 299(1–3), 81–106 (2003)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Kushilevitz, E., Mansour, Y.: Learning decision trees using the Fourier spectrum. SIAM Journal on Computing 22(6), 1331–1348 (1993)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Moshkovitz, D., Raz, R.: Sub-Constant Error Low Degree Test of Almost Linear Size. In: STOC 2006 (2006)Google Scholar
  11. 11.
    Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the XOR lemma. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 537–546 (1999)Google Scholar
  12. 12.
    Sudan, M.: Algorithmic Introduction to Coding Theory. Lecture Notes (2001)Google Scholar
  13. 13.
    Shpilka, A., Wigderson, A.: Derandomizing Homomorphism Testing in General Groups. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 427–435 (2004)Google Scholar
  14. 14.
    Trevisan, L.: Some Applications of Coding Theory in Computational Complexity. Survey Paper. Quaderni di Matematica 13, 347–424 (2004)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Elena Grigorescu
    • 1
  • Swastik Kopparty
    • 1
  • Madhu Sudan
    • 1
  1. 1.Massachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations