The combination of source address and a non-zero Flow Label (20 bits) value in the IPv6 header (see Figure 5) uniquely defines a traffic flow.
According to the service quality, the power and the subchannel resources are allocated according to the iterative resource allocation algorithm described in Algorithm 2. In order to achieve the concave function of the service quality, we defined the bit value function in that approximates the step functions as described in Figure5.
Since seven cases can be distinguished by three bits, we can compose a sequence of operations which maps a pair of padded 2-bit genotypes to seven different 3-bit values in the appropriate manner.
In this case, the inner product between the T b ms prompt correlator output vector and the possible bit value vector bm in (9) is given by I m Δ f d = R N ( Δ f d ) ⋅ b m, ( m = 1, 2 ) = ∑ k = 1 2 R T b, k Δ f d b ¯ m, k, m = 1, 2 (23).
Since the number of elements mapped to the left bin of stego object has reached 5, which is the amount of elements in the original object, no bit value can be embedded in the Unit any more.
Instead, we approximate the embedding by assuming the "worst-case" embedding, that is, we choose the hidden bit value that causes the higher increase in bit-rate.
Also, as shown in Figure6, the bit value of the MBMS approaches to zero when the allocated bit rate is higher than the maximum bit rate of 320 kbps.
Since is in the left bin, it corresponds to the bit value 0. Therefore, it should be moved to the right bin to embed a bit value 1. For, it should remain in the left bin to embed a bit value 0. To embed the third bit value 0 in the string, needs to be moved from the right to the left bin.
