lambda1@tg => YSITD: Proof. See Figure 3. Note that, formally, v might be a master node (and thus with an edge descending below it) but no codewords below it. This is why v and its descendants are all removed. Since T1's left child did not originally have a left child, ai can be moved there to become the leftmost grandchild of the root. T01 2 T0(n) by de finition. n > 3 ensures that depth(v) in T1 was at least 3. L(T01 )

lambda1@tg says to YSITD

Proof. See Figure 3. Note that, formally, v might be a master node (and thus with an edge descending below it) but no codewords below it. This is why v and its descendants are all removed. Since T1's left child did not originally have a left child, ai can be moved there to become the leftmost grandchild of the root. T01 2 T0(n) by de finition. n > 3 ensures that depth(v) in T1 was at least 3. L(T01 ) < L(T1) follows.

at Sun, Jul 26, 2020 11:52 PM