Blog
About

5
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      The hardness of decoding linear codes with preprocessing

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Related collections

          Most cited references 12

          • Record: found
          • Abstract: not found
          • Article: not found

          On the inherent intractability of certain coding problems (Corresp.)

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            The polynomial-time hierarchy

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Alternation

                Bookmark

                Author and article information

                Journal
                IEEE Transactions on Information Theory
                IEEE Trans. Inform. Theory
                Institute of Electrical and Electronics Engineers (IEEE)
                00189448
                March 1990
                : 36
                : 2
                : 381-385
                Article
                10.1109/18.52484
                Product

                Comments

                Comment on this article