With don't care con, 12 don't care conditions we can embed three bits, this

is because, if you want embed four bits, we may end up with the situation that,

it does not exist in these 12 don't care conditions, because 12 can

represent 8 different combinations for, of 3 bits, but not 4 bits.

So what we do is we consider the last 3 bits of

the watermark which is 010, which is a binary 2, so what we do is we come to

our list of don't care conditions, see zero, one, and the two.

So this is the don't care condi, condition,

we are going to specify a deterministic value to embed our signature.

And, what value should the system output in this don't care condition,

that depends on what is the message you want to embed here.

So, what we see in the original watermark, the next two bits, which because, our,

our output has two bits.

So, the next two bits are 00, so that is why,

I replace these don't cares by two zeroes.

And similarly, I can move out to the next three bits, I can do this because now,

the don't care table has 11 don't cares, I can still do, three bits.

So this 3-bit is 100, which is the binary four, so what I do is I count zero,

one, two, three, four, so this is the don't care condition,

I'm going to force a value, and the value happens to again to be 00,

because the next two bits in the watermark are 00.

And then, we keep on this process, and then the next one bit is 001,

which is the binary of one, so 01, and then the massive logo add,

add the, the leading bits, which is 10.

So now we have successfully convert, this 15-bit watermark into three pairs

of input and output, and we added them into the original truth table, and then

we got an augmented truth table, which we called the watermarked truth table.