article · 2006

The Discrete Memoryless Relay Channel: Joint-Decoding vs. Sequential Decoding of [CE79, theorem 6]

Ron Dabora, Sergio D. Servetto

Cited by 0Abstract and details only

Abstract

discrete output alphabets Y1 and Y and a probability density function p(y,y1|x1,x2) giving the probability distribution on Y×Y1 for each (x1,x2) ∈ X1×X2. The relay channel is called memoryless if the probability of a block of n transmissions is given by p(y,y1|x1,x2) = ∏ n i=1 p (yi,y1,i|x1,i,x2,i). Definition 2 A (2 nR,n) code for the relay channel consists of a source message set W = { 1,2,...,2 nR}, a mapping function f at the encoder, f: W ↦ → X n 1, a set of n relay functions x2,i = ti (y1,1,y1,2,...,y1,i−1), where the i’th relay function ti maps the first i − 1 channel inputs at the relay into a transmitted relay symbol at time i. Lastly we have a decoder g: Y n ↦ → W. Definition 3 The average probability of error of a code with length n for the relay channel is defined as = Pr(g(Y n) = W), where W is selected uniformly over W.

Cite this paper

APA 7

Dabora, R., & Servetto, S. D. (2006). The Discrete Memoryless Relay Channel: Joint-Decoding vs. Sequential Decoding of [CE79, theorem 6].

MLA 9

Dabora, Ron, and Sergio D. Servetto. “The Discrete Memoryless Relay Channel: Joint-Decoding vs. Sequential Decoding of [CE79, theorem 6].” 2006.

Chicago

Dabora, Ron, and Sergio D. Servetto. 2006. “The Discrete Memoryless Relay Channel: Joint-Decoding vs. Sequential Decoding of [CE79, theorem 6].”

Harvard

Dabora, R. and Servetto, S.D. (2006) ‘The Discrete Memoryless Relay Channel: Joint-Decoding vs. Sequential Decoding of [CE79, theorem 6]’.

BibTeX

@article{dabora2006discrete,
  title = {{The Discrete Memoryless Relay Channel: Joint-Decoding vs. Sequential Decoding of [CE79, theorem 6]}},
  author = {Dabora, Ron and Servetto, Sergio D.},
  year = {2006}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.