Abstract :
[en] Intersection codes are a superclass of Turbo- and LDPC codes. This class contains codes constructed by intersecting interleaved constituent codes. We propose a lower bound for the minimum distance of these codes. Using this bound, we compare intersection codes obtained from different constituent codes.
Scopus citations®
without self-citations
0