following:

1.  We give lower and upper bounds on GRWs of reducible codes, and exact values for cartesian products, giving a first step in the open problem of estimating or bounding the GRWs of a family of rank-metric codes for $ n > m $.

2.  We give new families of parameters for which reducible codes are MRD (some were given in [@reducible]), meaning that their first GRW is optimal and thus they are optimal regarding zero information leakage among all linear (over the extension or the base field) codes, by [@allertonversion Th. 3]. Using the estimates and exact values of GRWs of these codes in the previous item, we also give a first step in the open problem of finding the GRWs of a family of MRD codes for $ n > m $.

3.  We show that all linear (over the extension field) codes whose GRWs are all optimal for fixed packet and code sizes, but varying length, lie in the family of reducible codes from the previous item, up to rank equivalence.

4.  Finally, we show that information leakage when using reducible codes is often much less than the worst case given by their GRWs. In particular, 