• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Approximate list-decoding of direct product . . .

Cached

  • Download as a PDF

Download Links

  • [www.cs.ucsd.edu]
  • [www.cs.columbia.edu]
  • [www.cs.columbia.edu]
  • [www1.cs.columbia.edu]
  • [www.cs.sfu.ca]
  • [www.cs.sfu.ca]
  • [www.cs.ucsd.edu]
  • [www.cs.columbia.edu]
  • [www.cs.columbia.edu]
  • [cseweb.ucsd.edu]
  • [www1.cs.columbia.edu]
  • [www1.cs.columbia.edu]
  • [cseweb.ucsd.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Russell Impagliazzo , Ragesh Jaiswal , Valentine Kabanets
Citations:33 - 8 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Impagliazzo_approximatelist-decoding,
    author = {Russell Impagliazzo and Ragesh Jaiswal and Valentine Kabanets},
    title = {Approximate list-decoding of direct product . . . },
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Given a message msg ∈ {0, 1} N, its k-wise direct product encoding is the sequence of k-tuples (msg(i1),..., msg(ik)) over all possible k-tuples of indices (i1,..., ik) ∈ {1,..., N} k. We give an efficient randomized algorithm for approximate local list-decoding of direct product codes. That is, given oracle access to a word which agrees with a k-wise direct product encoding of some message msg ∈ {0, 1} N in at least ɛ � poly(1/k) fraction of positions, our algorithm outputs a list of poly(1/ɛ) strings that contains at least one string msg ′ which is equal to msg in all but at most k −Ω(1) fraction of positions. The decoding is local in that our algorithm outputs a list of Boolean circuits so that the jth bit of the ith output string can be computed by running the ith circuit on input j. The running time of the algorithm is polynomial in log N and 1/ɛ. In general, when ɛ> e−kα for a sufficiently small constant α> 0, we get a randomized approximate list-decoding algorithm that runs in time quasipolynomial in 1/ɛ, i.e., (1/ɛ) poly log 1/ɛ. As an application of our decoding algorithm, we get uniform hardness amplification for PNP�, the class of languages reducible to NP through one round of parallel oracle queries: If there is a language in PNP � that cannot be decided by any BPP algorithm on more that 1 − 1/nΩ(1) fraction of inputs, then there is another language in P NP � that cannot be decided by any BPP algorithm on more that 1/2 + 1/nω(1) fraction of inputs.

Keyphrases

direct product    approximate list-decoding    bpp algorithm    k-wise direct product encoding    randomized approximate list-decoding algorithm    oracle access    ith output string    small constant    possible k-tuples    parallel oracle query    message msg    direct product code    approximate local list-decoding    running time    uniform hardness amplification    ith circuit    jth bit    boolean circuit    string msg    efficient randomized algorithm   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University