### Skapa referens, olika format (klipp och klistra)

**Harvard**

Xiao, M., Medard, M. och Aulin, T. (2007) *A Binary Coding Approach for Combination Networks and General Erasure Networks*.

** BibTeX **

@conference{

Xiao2007,

author={Xiao, Ming and Medard, Muriel and Aulin, Tor},

title={A Binary Coding Approach for Combination Networks and General Erasure Networks},

booktitle={Proceeding of IEEE International Symposium on Information Theory (ISIT'07)},

pages={786-790},

abstract={We investigate a deterministic binary coding approach for
combination networks. In the literature, network coding schemes
with large alphabet sizes achieve the min-cut capacity. Here, we
propose an approach using binary (GF($2$)) sequences instead of
going to a large alphabet size. In the encoding process, only
cyclic-shifting and XOR operations are used. The encoding
complexity is linear with the length of information bits. The
transfer matrix is sparse, and the decoder can perfectly decode
source information by a sparse-matrix processing approach. Our
approach does not use any redundant bits, and achieves the min-cut
capacity. Further, the code blocks can be produced in a rateless
way. The sink can decode source information from any subset of
code blocks, if the number of received distinct blocks is the same
as that of the information blocks. Thus, we use the code for
general networks with erasure channels. The proposed binary
rateless codes have quite small overheads and can work with a
small number of blocks. With high probability, the codes behave as
maximum distance separable (MDS) codes.},

year={2007},

}

** RefWorks **

RT Conference Proceedings

SR Print

ID 45057

A1 Xiao, Ming

A1 Medard, Muriel

A1 Aulin, Tor

T1 A Binary Coding Approach for Combination Networks and General Erasure Networks

YR 2007

T2 Proceeding of IEEE International Symposium on Information Theory (ISIT'07)

SP 786

OP 790

AB We investigate a deterministic binary coding approach for
combination networks. In the literature, network coding schemes
with large alphabet sizes achieve the min-cut capacity. Here, we
propose an approach using binary (GF($2$)) sequences instead of
going to a large alphabet size. In the encoding process, only
cyclic-shifting and XOR operations are used. The encoding
complexity is linear with the length of information bits. The
transfer matrix is sparse, and the decoder can perfectly decode
source information by a sparse-matrix processing approach. Our
approach does not use any redundant bits, and achieves the min-cut
capacity. Further, the code blocks can be produced in a rateless
way. The sink can decode source information from any subset of
code blocks, if the number of received distinct blocks is the same
as that of the information blocks. Thus, we use the code for
general networks with erasure channels. The proposed binary
rateless codes have quite small overheads and can work with a
small number of blocks. With high probability, the codes behave as
maximum distance separable (MDS) codes.

LA eng

OL 30