Wiretap Channel with Information Embedding on Actions

Information embedding on actions is a new channel model in which a specific decoder is used to observe the actions taken by the encoder and retrieve part of the message intended for the receiver. We revisit this model and consider a different scenario where a secrecy constraint is imposed. By adding a wiretapper in the model, we aim to send the confidential message to the receiver and keep it secret from the wiretapper as much as possible. We characterize the inner and outer bounds on the capacity-equivocation region of such a channel with noncausal (and causal) channel state information. Furthermore, the lower and upper bounds on the sum secrecy capacity are also obtained. Besides, by eliminating the specific decoder, we get a new outer bound on the capacity-equivocation region of the wiretap channel with action-dependent states and prove it is tighter than the existing outer bound. A binary example is presented to illustrate the tradeoff between the sum secrecy rate and the information embedding rate under the secrecy constraint. We find that the secrecy constraint and the communication requirements of information embedding have a negative impact on improving the secrecy transmission rate of the given communication link.


Introduction
In wireless communication systems, such as sensor networks, mobile networks and satellite communications, sensitive data is transferred through multiple hops.The nodes in the network usually need to take various type of actions to acquire the state of the network before transferring the packets.The state acquisition in the network often requires the exchange of control information, which uses physical resources within the system.For example, routers measure the network congestion levels via the transmission of probing packets; wireless transceivers evaluate the channel quality through training or feedback; and radio terminals switch among different operating modes, such as transmit, receive or idle.Based on these motivating observations, Weissman introduced channels with action-dependent states where the encoder in a point-to-point channel could take actions to affect the channel state information [1].The capacity of such a channel where the channel inputs depended noncausally (and causally) on the channel states was determined.After Weissman's publication, [2] investigated the channel model where both the channel encoder and decoder could probe the channel states and obtained the cost constrained "probing capacity".Different from this, [1][2][3] studied the degraded broadcast channel with causal action-dependent states where the transmitter sent two kinds of messages to two different receivers.The capacity region was derived.For the noncausal case, only inner and outer bounds on the capacity region were obtained [4].Other extensions of the channel with action-dependent states can be seen in [5][6][7][8][9][10].
Recently, [11,12] explored information embedding on actions in the channel with noncausal action-dependent states; see Figure 1.In this new setup, an additional decoder was introduced to observe a function of the actions taken by the encoder.It tried to get part of the transmitted message.Actually, the idea of "information embedding" on actions in such a channel is related to the classical topic of information hiding (e.g., [13][14][15][16][17]) and could be explained by the following example.In communication networks, probing the congestion state requires sending training packets to the nearest router.Meanwhile, the router (the "recipient" of the actions) may need to obtain partial information, such as the header of the packet, to find the address of the intended receiver.Since the actions play the role of providing necessary information about the message for the router, it is natural to ask how much information could be embedded in the actions without affecting the system performance.[11] got the capacity-cost region and showed that the communication requirements of the action-cribbing decoder were generally in conflict with the goal of improving the efficiency of the communication link.
However, the above action-dependent channel models [1][2][3][4][5][6][7][8][9][10][11][12] considered no secrecy constraint, which was extremely important in communications.For instance, the broadcast nature of wireless networks gives rise to the hidden danger of information leakage to malicious receiver when broadcasting the sensitive data and acquiring the state information.Recent works [18,19] studied the secure communication problems in channels with action-dependent states.[18] added a wiretapper to the model in [1] and got the inner and outer bounds on the capacity-equivocation region.The capacity-equivocation region is the set of all the achievable rate pairs (R, R e ), where R and R e are the rates of the confidential message and wiretapper's equivocation about the message.[19] studied the effects of feedback on the secrecy capacity, which is the maximum rate of data transmission at which the message can be communicated in perfect secrecy, of the wiretap channel with action-dependent states.From the perspective of secure communication, we consider a different communication model in Figure 2, i.e., the wiretap channel with information embedding on actions.In this setup, the transmitter aims to send the confidential message to the receiver and keep it secret from the wiretapper as much as possible.We use equivocation (i.e., the uncertainty about the confidential message) at the wiretapper to measure the level of information leakage.Meanwhile, like [11], a specific decoder is introduced to retrieve a portion of the confidential message (see m 1 in Figure 2).The specific decoder observes a function of the message-dependent actions, which affects the formulation of the channel states.Our work is novel in the sense that we consider the secrecy constraint in the information transmission, and we try to characterize how much information could be embedded in the actions without increasing the information leakage.For the new channel model described above, this paper obtains the inner and outer bounds on the capacity-equivocation region of such a channel with noncausal (and causal) channel state information.Furthermore, the lower and upper bounds on the sum secrecy capacity are also attained.Through a special case where no message needs to be retrieved by the specific decoder, we get a new outer bound on the capacity-equivocation region of the wiretap channel with action-dependent states and prove that it is tighter than the existing outer bound.To illustrate the tradeoff between the sum secrecy rate and the information embedding rate under the secrecy constraint, we provide a binary example.It shows that the sum secrecy rate is reduced when the information embedding rate increases.We find that the secrecy constraint and the communication requirements of the specific decoder have a negative impact on improving the secrecy transmission rate of the given communication link.
The rest of the article is organized as follows.Section 2 describes the wiretap channel with information embedding on actions and outlines the main results.Section 3 discusses the results and presents a binary example.We conclude in Section 4 with a summary of the whole work and some future directions.

Channel Model and Main Results
The symbol notations and description of the channel model are presented in Subsection 2.1.Subsection 2.2 characterizes the inner and outer bounds on the capacity-equivocation region of the wiretap channel with information embedding on actions.

Symbol Notations and Channel Model
Throughout this paper, we use calligraphic letters, e.g., X , Y, to denote the finite sets and ∥X ∥ to denote the cardinality of the set, X .Uppercase letters, e.g., X, Y , are used to denote random variables taking values from finite sets, e.g., X , Y.The value of a random variable, X, is denoted by the lowercase letter, x.We use Z j i to denote the (j − i + 1)-vectors (Z i , Z i+1 , ..., Z j ) of random variables for 1 ≤ i ≤ j and will always drop the subscript when i = 1.Moreover, we use X ∼ p(x) to denote the probability mass function of the random variable, X.For X ∼ p(x) and 0 ≤ ϵ ≤ 1, the set of the typical N -sequences x N is defined as for all x ∈ X }, where π(x|x N ) denotes the frequency of occurrences of letter x in the sequence, x N (for more details about typical sequences, please refer to [23,24]).The set of the conditional typical sequences, e.g., T N Y |X (ϵ), follows similarly.In this paper, it is assumed that the base of the log function is two.
The wiretap channel with information embedding on actions is depicted in Figure 2. We aim to send the confidential message (M 1 , M 2 ) to the legitimate receiver through such a channel and keep it secret from the wiretapper as much as possible.Part of the message embedded in the actions needs to be retrieved by the specific decoder.We use equivocation at the wiretapper to measure the secrecy of the confidential message.
Concretely, the model of wiretap channel with information embedding on actions is specified by {A, B, S, f, p(s|a), X , p(y, z|s, x), Y, Z}.To send the message (M 1 , M 2 ), an action sequence, A N (M 1 , M 2 ), is first selected by the encoder.Then, the generation of the channel states, S N , is affected by the actions, instead of by nature.The channel states, S N , are generated through a discrete memoryless The main channel is a DMC with discrete input alphabet X ×S and output alphabet Y.The channel is memoryless in the sense that p(y Decoder 1 observes signal B N as a deterministic function of the actions, A N , i.e., B N = f (A N ).It estimates part of the transmitted message.Decoder 1 is specified by ψ 1 : B N → M 1 .The output of Decoder 1 is M1 .The probability of the error of Decoder 1 is defined as The legitimate receiver decodes the message ( M1 , M2 ) by Decoder 2 (see Figure 2).Decoder 2 is specified by The probability of the error of Decoder 2 is defined as The wiretap channel is also a DMC with transition probability p(z where z N ∈ Z N is the observation of the wiretapper.The uncertainty of the message for the wiretapper is measured by lim . In our model, the wiretap channel is assumed to be degraded from the main channel, i.e., X → Y → Z form a Markov chain.
Then, we give the definition of "achievable" and "sum secrecy capacity" as follows.
) is said to be achievable for the model in Figure 2 if there exists a channel encoder-decoder, such that: lim lim where ϵ is an arbitrary small positive real number, (R 1 , R 2 ) are the rates of the message (M 1 , M 2 ) and R e is the rate of equivocation.The capacity-equivocation region is defined as the convex closure of all achievable rate triples (R 1 , R 2 , R e ).

Definition 2
The sum secrecy capacity is the maximum rate at which the confidential message can be sent to the receiver in perfect secrecy.The sum secrecy capacity: where R is the capacity-equivocation region.
Based on the definition in Equation ( 5), the sum secrecy capacity for the model in Figure 2 with noncausal action-dependent states is , where R n is the capacity-equivocation region of the noncausal case.Similarly, we can define the sum secrecy capacity of the causal case, C sc .

Main Results
In this subsection, four theorems are presented.Theorems 1 and 2 give the inner and outer bounds on the capacity-equivocation region for the channel model in Figure 2 with noncausal action-dependent states.For the causal case, the inner and outer bounds are characterized in Theorems 3 and 4.

Theorem 1 An achievable rate-equivocation region of the wiretap channel with information embedding on actions when the states are noncausally known to the channel encoder is the set:
where the joint distributions p(a, b, u, x, s, y, z Theorem 2 An outer bound on the capacity-equivocation region of the wiretap channel with information embedding on actions when the states are noncausally known to the channel encoder is the set: where the joint distributions p(a, b, u, x, s, y, z) = p(z|y)p(y|x, s)p(x|u, s)p(q|v)p(v|u)p(a, u, s)

Comments:
• Theorems 1 and 2 are proven in Appendix A.
• To exhaust R in and R on , it is enough to restrict U, V and Q to satisfy: This can be easily proven by using the support lemma (see p. 310 in [25]).
Theorem 3 An achievable rate-equivocation of the wiretap channel with information embedding on actions when the states are causally known to the channel encoder is the set: where the joint distributions p(a, b, u, x, s, y, z) = p(z|y)p(y|x, s)p(x|u, s)p(s|a)p(u|a)p(a) Theorem 4 An outer bound on the capacity-equivocation region of the wiretap channel with information embedding on actions when the states are causally known to the channel encoder is the set: ) where the joint distributions p(a, b, u, x, s, y, z) = p(z|y)p(y|x, s)p(x|u, s)p(q|v)p(v|u)p(a, u, s) Comments: • Theorems 3 and 4 are proven in Appendix B.
• To exhaust R ic and R oc , it is enough to restrict U, V and Q to satisfy: This can be easily proven by using the support lemma (see p. 310 in [25]).Further discussion about the theorems and the comparison with other existing results are given in Section 3.

Discussion and Example
In this section, we first calculate the sum secrecy capacities of the noncausal and causal cases.Then, we compare our results with some existing results and present a binary example to illustrate the tradeoff between the sum secrecy rate and the information embedding rate under the secrecy constraint.

Discussion
Corollary 1 The lower and upper bounds on the sum secrecy capacity of the model in Figure 2 with noncausal action-dependent states are: and: respectively.
Proof: According to the definition of Formula ( 5), R in and R on , we can easily get Equations ( 20) and (21).
Similarly, we have the following corollary for the causal case.

Corollary 2
The lower and upper bounds on the sum secrecy capacity of the model in Figure 2 with causal action-dependent states are: and: respectively.
Proof: According to the definition of Formula ( 5), R ic and R oc , we can easily get Equations ( 22) and ( 23).
According to [11], the capacity region of the model in Figure 1 (without the secrecy constraint) is: Then, the corresponding capacity is: Compare Formula (26) with (20); we can get C ln ≤ C E .This implies that the secrecy constraint reduces the secrecy transmission rate of the communication link.Therefore, once the problem of information leakage is considered, the system designer has to trade off between the transmission rate and data security.Moreover, without the secrecy constraint, we have the following corollary.
Corollary 3 Without considering the secrecy constraint (i.e., ignoring R e in R in ), we arrive at the results in [11].Proof: This corollary is verified by setting R e = 0 in R in .
When no message needs to be embedded in the actions, the model in Figure 2 turns to the wiretap channel with action-dependent states [18]; see Figure 3. [18] gave an upper bound on the secrecy capacity of the model with noncausal states as: Substituting R 1 = 0 into R on , we get a new upper bound on the secrecy capacity of the model in Figure 3 with noncausal states.This new upper bound is: where R nd is the capacity-equivocation region of the model with noncausal states.Note that the difference between Equations ( 28) and ( 27) is the extra term, I(U ; S|V ).The cause of the emergence of this term is stated in detail at the end of Appendix A. Then, we give the following corollary.Corollary 4 For the wiretap channel with noncausal action-dependent states shown in Figure 3, the new upper bound on the secrecy capacity C ′ un ≤ C dain .Proof: From the two Formulas, ( 27) and ( 28), we can get the difference between C ′ un and C dain as: It is easy to see that Λ 1 ≥ 0, i.e., our new upper bound C ′ un ≤ C dain .Note that it is always desired to find a smaller upper bound to approach the secrecy capacity.
Similarly, substituting R 1 = 0 into R oc , we can get an upper bound on the secrecy capacity of the model in Figure 3 with causal states, which is: where R cd is the capacity-equivocation region of the model with causal states.C ′ uc coincides with the upper bound on the secrecy capacity of the model in [18] with causal states.
Then, we study a special channel model where the "action" is removed, i.e., the wiretap channel with noncausal channel state information.In this model, the channel state is generated by nature.This model is a special case of the wiretap channel with information embedding on actions by eliminating the action encoder and the mapping, f .It is also a special case of the model in Figure 3 without action.Setting the random variable, A, in Equation (28) to be a constant, we get a new outer bound of the wiretap channel with noncausal channel state information as: The outer bound in [20] was derived as C ′ dain = max p(u,v,q,x,s) min{I(U ; Y )−I(U ; S), I(U ; Y )−I(V ; Z|Q)}.
Comparing the two bounds, we see that C ′′ un ≤ C ′ dain .This is stated in the following corollary.
Corollary 5 For the wiretap channel with noncausal channel state information [20], the new upper bound on the secrecy capacity C ′′ un ≤ C ′ dain .
In addition, in the case of no actions, our model turns into a special case that was also studied in [21].The comparison between our results and those in [21] for this case is stated as follows.
• The achievable rate-equivocation region of the special case obtained from [21] is contained in that obtained from our results.• We also provide an outer bound for this special case.
[21] obtained an achievable rate region for the broadcast wiretap channel with the asymmetric side information, which was: We first give an equivalent expression of the achievable rate region R I as follows.
where R e1 and R e2 are the equivocation rates of the messages, m 1 and m 2 , respectively.We can easily prove that R ′ I is equivalent to R I via replacing Formulas ( 9), ( 10) and ( 11) in [21] accordingly by: Since information is embedded on the actions, the information embedding rate R 1 = 0 when no actions are imposed in our model.At the same time, the specific decoder (Decoder 1) is no longer needed.For this special case, we get its achievable rate-equivocation region from our results (by setting R 1 = 0 and A = const in R in ) as: As stated in [21], by removing the receiver (D 1 ) and the side information (S 2 = C) in the model considered in [21], we also arrive at the special case.Removing R 1 , R e1 , Y 1 , U 1 and S 2 in R ′ I , one has an achievable rate-equivocation region as: For simplicity, we replace U 2 , S 1 , R e2 and Y 2 by U , S, R e and Y , respectively.We then show that From Equations ( 43) and (44), Therefore, (R 2 , R e ) ∈ R special .This verifies R ′ special ⊆ R special .Moreover, we get an outer bound for the special case.The outer bound is: It can be directly gotten from R on by setting R 1 = 0 and A = const.Note that [21] did not provide an outer bound.

A Binary Example
We give an example of a binary symmetric channel with causal channel states.The channel model is shown in Figure 4. Let the main channel be a binary symmetric channel (BSC).Its crossover probability is affected by the channel states.The wiretap channel is also assumed to be a BSC with crossover probability q.More precisely, define: and: where i ∈ {0, 1}, 0 ≤ p ≤ 1 and 0 ≤ q ≤ 1.
It is assumed that the channel from the action to the channel states is a BSC with crossover probability equal to α, where 0 ≤ α ≤ 1.In this example, the parameter, α, is fixed as 0.2 (the other value of α could also be assumed).Similar to the arguments in [1,18,19], the maximum values of H(A|Z), I(U ; Y ) and I(U ; Y ) − I(U ; Z) are achieved when g 1 : U → A and g 2 : U × S → X are deterministic mappings.We choose g 1 and g 2 as: where i, j ∈ {0, 1}.Let B ∼ Bernoulli(β), where 0 ≤ β ≤ 1.Let the function, f , be a one-to-one mapping for simplicity.Here, we set: From the above conditions, we see that the random variables, B, A and U , share the same distribution.Then, the joint distribution p(a, b, s, u, x, y, z b,s,x,y   p(a, b, s, u, x, y, z) can also be obtained.By some mathematical calculation and Theorem 3, we can get the maximum sum secrecy rate of the example with causal channel states for given p, q as: under the constraint H(B) = h(β) ≥ R 1 and the secrecy constraint: where p * q = p+q−2pq and h(p) is the binary entropy function, i.e., h(p) = −p log p−(1−p) log(1−p).The tradeoff between the sum secrecy rate and the information embedding rate under the secrecy constraint is shown in Figure 5.It can be seen that the sum secrecy rate is reduced when the equivocation rate, R e , increases.In practical communication systems involving security, we always desire a bigger secure transmission rate when the extent of information leakage is at a reasonable level.Moreover, it can be seen that when the information embedding rate, R 1 , goes up, the sum secrecy rate also decreases.This tells us that the communication requirements of Decoder 1 have a negative impact on improving the secrecy transmission rate of the given communication link.

Conclusions
This paper studies the wiretap channel with information embedding on actions.In this extended setup, the confidential message needs to be decoded only by the receiver and kept secret from the wiretapper as much as possible.Meanwhile, a specific decoder is introduced in the model to observe a function of the actions and wishes to decode part of the transmitted message.Our channel model is actually an extension of Ahmadi's channel with information embedding [11] by considering the secrecy constraint.We get the inner and outer bounds on the capacity-equivocation region of such a channel with noncausal (and causal) channel states.The corresponding lower and upper bounds on the sum secrecy capacity are also obtained.Besides, through a special case, we get a new upper bound on the secrecy capacity of the wiretap channel with action-dependent states and show that it is tighter than the upper bound obtained in [18].We also discuss the tradeoff between the sum secrecy rate and the information embedding rate under the secrecy constraint.
Some potential directions that are worthy of being explored are listed as follows.
• In practical application, the wiretapper may also wish to eavesdrop on the embedded information.
In the example of communication networks, the information embedded in the packet for the next router may also be of interest to the eavesdropper.Our current setting does not consider the confidentiality of m 1 and m 2 separately, so this problem will be further explored.• Only inner and outer bounds on the capacity-equivocation region are obtained at present.We can try to find some special cases where the two bounds match.Moreover, if there exists a channel between A N and B N instead of a function, what will the capacity-equivocation region be?• Adaptive action means that the action sequence is generated by the message and the previous channel states, i.e., a i (m, s i−1 ).Adaptive action is widely used in many applications, such as information hiding, digital watermarking and data storage in the memory.It is valuable to study the adaptive action in our model.From [10], we have already known that adaptive action is not useful in increasing the point-to-point channel capacity.We will study whether it influences the sum secrecy capacity of our channel model under the secrecy constraint.

Appendix
A. Proof of Theorems 1 and 2 In this section, Theorems 1 and 2 are proven.To prove Theorem 1, the methods in [18] are utilized, and we present a coding scheme for the model in Figure 2 with noncausal action-dependent states in Subsection A.1.The proof of Theorem 2 is given in Subsection A.2.

A.1. Proof of Theorem 1
We need to prove that any rate-equivocation triple (R 1 , R 2 , R e ) ∈ R in is achievable.Similar to [18], two cases are considered.Since the channel states are noncausally known to the channel encoder, Gel'fand and Pinsker's coding technique [22] will be used in the encoding process.In this case, we need to prove that any rate-equivocation triple (R 1 , R 2 , R e ) satisfying the following constraints are achievable.
These codewords are put into ∥T b ∥ = 2 N (max{I(U ;S|A),I(U ;Z)}−I(U ;Z)+ϵ ′ ) bins, such that each bin contains ∥T ∥/∥T b ∥ codewords.Note that t b , t u are the indexes of the bin and codeword, respectively.The codebook structure is shown in Figure A1.To send the message (m 1 , m 2 ) with the action sequence, a N (m 1 , m 2 ), and corresponding state sequence s N , the encoder chooses a u N (m 1 , m 2 , t b , t u ) from the ∥T ∥ sequences, such that (u If no such sequence exists, it picks (t b , t u ) = (1, 1).Then, the input sequence of the channel is generated by  Decoding and error probability analysis: Decoder 1 can decode the message, m 1 , correctly, since R 1 ≤ H(B).For the receiver, he tries to find a unique sequence u N ( m1 , m2 , tb , tu ), such that (u N ( m1 , m2 tb , tu ), a N ( m1 , m2 ), y N ) ∈ T N U AY .It is easy to show the decoding error probabilities P e1 ≤ ϵ and P e2 ≤ ϵ by similar arguments in [11,12].We mainly focus on the analysis of equivocation.

A.2. Proof of Theorem 2
In this subsection, we prove that all achievable rate triples (R 1 , R 2 , R e ) for the model in Figure 2 with noncausal channel states are contained in R on .
To prove condition in Equation ( 11), we consider: where Equation ( 58) is based on Fano's inequality.
To prove the condition in Equation ( 12), we consider: where Equation ( 60) is based on Fano's inequality.Then, the mutual information I(M 1 , M 2 ; Y N ) in Equation ( 60) is calculated as follows.
In the above deduction, Equation ( 61) is from the Markov chain ), which can be derived similarly according to [1] and [18].The Equation ( 63) is from the Markov chain S i → A i → (S N i+1 , A i−1 , A N i+1 ).The Equation (64) is from defining U i = (M 1 , M 2 , Y i−1 , S N i+1 , A N ).The condition in Equation ( 13) is proven as follows.
The condition in Equation ( 14) is proven as follows.
From Equation (62), we have: Similarly, we can get: and: respectively.Then, the term, I(U i ; S i |A i ), was offset in [18] by subtraction in order to obtain their upper bound.However, the weak aspect of calculating the two terms independently is that the interrelation between the two terms are missed.
In our proof, we focus on calculating I(M 1 , M 2 ; Y N ) − I(M 1 , M 2 ; Z N ).The result is shown in Equation (71).The main difference in the proof steps between our work and [18] is Equations ( 69) and (70).In the above derivation, we can see that the extra term, I(U i ; S i |V i ), is originated from

B. Proof of Theorems 3 and 4
In this section, Theorems 3 and 4 are proven.To prove Theorem 3, the methods in [18] are utilized and a coding scheme for the model in Figure 2 with causal action-dependent states is provided in Subsection B.1.Subsection B.2 gives the proof of the outer bound on the capacity-equivocation region.

B.1. Proof of Theorem 3
We need to prove that any achievable rate triple (R 1 , R 2 , R e ) ∈ R ic is achievable.Two cases are considered.

B.1.1. H(A|Z) ≥ I(U ; Y ) − I(U ; Z)
In this case, we need to prove that any rate-equivocation triple (R 1 , R 2 , R e ) satisfying the following constraints are achievable.

Figure 2 .
Figure 2. Wiretap channel with information embedding on actions.

Figure 4 .
Figure 4.The binary symmetric channel with information embedding on actions.

Figure 5 .
Figure 5.The tradeoff between the sum secrecy rate and the information embedding rate under the secrecy constraint.

R
e ≤ I(U ; Y ) − I(U ; Z) It is sufficient to show that the rate triples (R 1 , R 2 , R e = I(U ; Y ) − I(U ; Z)) are achievable.The coding scheme includes codebook generation, encoding and decoding.Then, we give the equivocation analysis.Codebook generation and encoding:Let R 1 = H(B) − θ 1 and R 1 + R 2 = I(U ; Y ) − θ 2 , where θ 1 , θ 2 are fixed positive numbers.Since R e ≤ R 1 + R 2 , it is easy to get θ 2 ≤ I(U ; Z).For each m 1 ∈ {1, 2, ..., 2 N R 1 }, an independent and identically distributed (i.i.d) codeword, b N (m 1 ), is generated according to p(b N ) = N ∏ i=1 p(b i ).Then, 2 N R2 action sequences a N (m 1 , m 2 ) are i.i.d generated for each b N (m 1 ) according to p(a N (m 1 , m 2 )|b N (m 1 )) = N ∏ i=1 p(a i |b i ), where m 2 ∈ {1, 2, ..., 2 N R 2 }.For each 1,and φ(x N |m 1 , m 2 , s N ) is the probability that the message (m 1 , m 2 ) and the state sequence, s N , are encoded as the channel input, x N .When the state sequence, s N , is known causally by the channel encoder, the channel encoder at time i is specified by φ i (x i |m 1 , m 2 , s i ), where x i is the output of the channel encoder at time i and s i = (s 1 , s 2 , ..., s i ) is the channel states up to time i.When the channel encoder knows the state, s N , in a noncausal manner, the channel encoder at time i is specified by φ