On approximately universal schemes for two-hop networks


Autoria(s): Vinodh, K; Ray, A; Kumar, PV
Data(s)

31/01/2010

Resumo

Full-duplex and half-duplex two-hop networks are considered. Explicit coding schemes which are approximately universal over a class of fading distributions are identified, for the case when the network has either one or two relays.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/39046/1/On_Approximately.pdf

Vinodh, K and Ray, A and Kumar, PV (2010) On approximately universal schemes for two-hop networks. In: Communications (NCC), 2010 National Conference on , 29-31 Jan. 2010, Chennai.

Publicador

IEEE

Relação

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5430226

http://eprints.iisc.ernet.in/39046/

Palavras-Chave #Electrical Communication Engineering
Tipo

Conference Paper

PeerReviewed