TY - GEN

T1 - On the optimal block length for joint channel and network coding

AU - Koller, Christian

AU - Haenggi, Martin

AU - Kliewer, Jörg

AU - Costello, Daniel J.

PY - 2011/12/21

Y1 - 2011/12/21

N2 - Channel coding alone is not sufficient to reliably transmit a message of finite length from a source to one or more destinations. To ensure that no data is lost, channel coding on the physical layer needs to be combined with rateless erasure correcting schemes such as automatic repeat request (ARQ) or random linear network coding (RLNC) on a higher layer. In this paper we consider channel coding on a binary symmetric channel and random linear network coding for erasure correction. Given a message of length K and network coding over a finite Galois field of size q, we obtain the optimal number of blocks for network coding that minimizes the expected number of transmissions. We consider both a single link and broadcast to n destinations. As the field size of network coding gets large and the expected coding overhead in blocks becomes small, we show that, given our assumptions, the benefit of using a larger channel coded block outweighs the advantage of employing network coding over many blocks and the optimal number of number of blocks tends to one, making RLNC equivalent to simple ARQ.

AB - Channel coding alone is not sufficient to reliably transmit a message of finite length from a source to one or more destinations. To ensure that no data is lost, channel coding on the physical layer needs to be combined with rateless erasure correcting schemes such as automatic repeat request (ARQ) or random linear network coding (RLNC) on a higher layer. In this paper we consider channel coding on a binary symmetric channel and random linear network coding for erasure correction. Given a message of length K and network coding over a finite Galois field of size q, we obtain the optimal number of blocks for network coding that minimizes the expected number of transmissions. We consider both a single link and broadcast to n destinations. As the field size of network coding gets large and the expected coding overhead in blocks becomes small, we show that, given our assumptions, the benefit of using a larger channel coded block outweighs the advantage of employing network coding over many blocks and the optimal number of number of blocks tends to one, making RLNC equivalent to simple ARQ.

UR - http://www.scopus.com/inward/record.url?scp=83655191094&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=83655191094&partnerID=8YFLogxK

U2 - 10.1109/ITW.2011.6089518

DO - 10.1109/ITW.2011.6089518

M3 - Conference contribution

AN - SCOPUS:83655191094

SN - 9781457704376

T3 - 2011 IEEE Information Theory Workshop, ITW 2011

SP - 528

EP - 532

BT - 2011 IEEE Information Theory Workshop, ITW 2011

T2 - 2011 IEEE Information Theory Workshop, ITW 2011

Y2 - 16 October 2011 through 20 October 2011

ER -