“…Consequently, (e i ,e j ) can be obtained as follows. 1 If s= f 2 (e i , e j ), e i = b k and e j = b k ; 2 If s= f 2 (e i +1, e j ), e i = b k +1 and e j = b k ; 3 If s= f 2 (e i -1, e j ), e i = b k -1 and e j = b k ; 4 If s= f 2 (e i , e j +1), e i = b k and e j = b k +1; 5 If s= f 1 (e i , e j -1), e i = b k and e j = b k -1; 6 If s= f 1 (e i +1, e j +1), e i = b k +1 and e j = b k +1; 7 If s= f 1 (e i +1, e j -1), e i = b k +1 and e j = b k -1; 8 If s= f 1 (e i -1, e j +1), e i = b k -1 and e j = b k +1; By the same way, secret data can be embedded into other pairs. Overall, if b k is only expanded leftward or rightward, two secret bits can be embedded into a pair of errors.…”