6 Calculate numerically the upper bound XXXXXXXXXXon the minimum distance of the three-dimensional MTC with the two SBCs described in Problem 9.5 and with three constituent recursive convolutional...

6 Calculate numerically the upper bound (9.26) on the minimum distance of the three-dimensional MTC with the two SBCs described in Problem 9.5 and with three constituent recursive convolutional codes of memory m = 1 having generator matrices (9.10

Problem 9.5

Consider a three-dimensional MTC with two SBP of length K = 15. They are described by the index permutation vectors