Superproduct codes with improved minimum distance

R. Michael Tanner · 2003

Superproduct codes are formed by imposing row subcode and column subcode constraints on an array of bits constituting a codeword. Carefully choosing permuted orders for the bits in each of the subcodes produces codes with almost all the desirable properties of product codes, but significantly improved minimum distance and superior decoder performance at high SNR.

Read the paper · More papers on PaperTik