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

      Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers

      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 references12

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

          The capacity of low-density parity-check codes under message-passing decoding

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

            Design of capacity-approaching irregular low-density parity-check codes

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

              Finite-length analysis of low-density parity-check codes on the binary erasure channel

                Bookmark

                Author and article information

                Journal
                IEEE Transactions on Information Theory
                IEEE Trans. Inform. Theory
                Institute of Electrical and Electronics Engineers (IEEE)
                0018-9448
                1557-9654
                August 2008
                August 2008
                : 54
                : 8
                : 3763-3768
                Article
                10.1109/TIT.2008.926319
                4a020302-0a4b-4c62-b106-bfef7979d172
                © 2008
                History

                Comments

                Comment on this article