Deterministic network coding algorithms and applications for wireless networks

We give new deterministic and randomized algorithms for the wireless model of Avestimehr, Diggavi, Tse for Gaussian relay networks by reducing it to the more general deterministic network coding problem introduced by Harvey, Karger and Murota. We also give a sufficient condition for a subset of codi...

Full description

Saved in:
Bibliographic Details
Published in2012 International Symposium on Network Coding (NetCod) pp. 103 - 107
Main Authors Kiraly, Z., Kovacs, E. R.
Format Conference Proceeding
LanguageEnglish
Japanese
Published IEEE 01.06.2012
Subjects
Encoding
Network coding
Relays
Unicast
Vectors
Wireless networks
Online AccessGet full text
ISBN9781467318907
1467318906
ISSN2374-9660
DOI10.1109/NETCOD.2012.6261892

Cover

More Information
Summary:We give new deterministic and randomized algorithms for the wireless model of Avestimehr, Diggavi, Tse for Gaussian relay networks by reducing it to the more general deterministic network coding problem introduced by Harvey, Karger and Murota. We also give a sufficient condition for a subset of coding coefficients which can be fixed arbitrarily to nonzero values, and the remaining coefficients can be determined in order to have a feasible network code. Finally we present applications to networks with nodes of different transmission properties.
ISBN:9781467318907
1467318906
ISSN:2374-9660
DOI:10.1109/NETCOD.2012.6261892