Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes.

David Burshtein, Idan Goldenberg

Browse the full ISIT paper archive.