David Burshtein, Idan Goldenberg. Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes. In Alexander Kuleshov, Vladimir Blinovsky, Anthony Ephremides, editors, 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011. pages 1263-1267, IEEE, 2011. [doi]
Abstract is missing.