Suppose that the constituent codes of the turbo code in Problem 9.2 have memory m = 1 and generator matrices XXXXXXXXXXShow that the minimum distance of this turbo code is upper-bounded by 6, d min ≤...

Suppose that the constituent codes of the turbo code in Problem 9.2 have memory m = 1 and generator matrices (9.10). Show that the minimum distance of this turbo code is upper-bounded by 6, d_min
≤ 6. Can you find a tighter upper bound

Problem 9.2

Consider a turbo code with an SBP of length K = 15 described by the index permutation vector

Which permutor P corresponds to this index permutation vector? Construct the inverse of the permutor P.