Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance

David Burshtein, Idan Goldenberg. Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance. IEEE Transactions on Information Theory, 57(11):7386-7402, 2011. [doi]

@article{BurshteinG11,
  title = {Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance},
  author = {David Burshtein and Idan Goldenberg},
  year = {2011},
  doi = {10.1109/TIT.2011.2162224},
  url = {http://dx.doi.org/10.1109/TIT.2011.2162224},
  researchr = {https://researchr.org/publication/BurshteinG11},
  cites = {0},
  citedby = {0},
  journal = {IEEE Transactions on Information Theory},
  volume = {57},
  number = {11},
  pages = {7386-7402},
}