skip to main content
10.1145/2634274.2634280acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
research-article

Resource-competitive error correction

Published:11 August 2014Publication History

ABSTRACT

We present a resource-competitive Monte Carlo algorithm for the problem of error correction for message transmission along a noisy channel when a limited amount of feedback is available. To transmit a message of length n in the presence of T ≤ n/log n adversarial errors, our algorithm sends n + 2√{n(T+1)log n} +c T log n bits.

References

  1. . Alon, O. Goldreich, J. Hå stad, and R. Peralta. Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms, 3(3):289--304, 1992.Google ScholarGoogle ScholarCross RefCross Ref
  2. S. Gilbert, R. Guerraoui, and C. Newport. Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks. OPODIS 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. . Gilbert, V. King, S. Pettie, E. Porat, J. Saia, and M. Young(Near) Optimal Resource-Competitive Broadcast with Jamming. SPAA 2014 Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. . Gilbert, V. King, J. Saia, and M. Young Resource-Competitive Analysis: A New Perspective on Attack-Resistant Distributed Computing. FOMC 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. S. Gilbert and M. Young. Making Evildoers Pay: Resource-Competitive Broadcast in Sensor Networks. PODC 2012 Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. . King, J. Saia, and M. Young Conflict on a Communication Channel. PODC 2011 Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. . Kol and R. Raz. Interactive channel capacity. STOC 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-Correcting Codes. North-Holland: New York, NY, 1977.Google ScholarGoogle Scholar
  9. . Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput., 22(4):838--856, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Resource-competitive error correction

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        FOMC '14: Proceedings of the 10th ACM international workshop on Foundations of mobile computing
        August 2014
        66 pages
        ISBN:9781450329842
        DOI:10.1145/2634274

        Copyright © 2014 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 11 August 2014

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        FOMC '14 Paper Acceptance Rate7of8submissions,88%Overall Acceptance Rate7of8submissions,88%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader