Abstract:
We introduce a family of sparse random linear network codes with outer-code. Due to the bold role of the incomplete gamma function in their design, we call these codes “G...Show MoreMetadata
Abstract:
We introduce a family of sparse random linear network codes with outer-code. Due to the bold role of the incomplete gamma function in their design, we call these codes “Gamma codes”. We show that Gamma codes outperform all the existing linear-complexity network coding solutions in terms of reception overhead, while keeping the encoding and decoding complexity linear in the block length.
Published in: 2012 International Symposium on Network Coding (NetCod)
Date of Conference: 29-30 June 2012
Date Added to IEEE Xplore: 09 August 2012
ISBN Information:
Print ISSN: 2374-9660
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Network Coding ,
- Random Networks ,
- Block Length ,
- Incomplete Gamma Function ,
- Linear Combination ,
- Optimal Rate ,
- Coefficient Vector ,
- Degree Distribution ,
- System Of Linear Equations ,
- Codeword ,
- Finite Length ,
- Random Code ,
- Decoding Process ,
- Linear Complexity ,
- Linear Code ,
- Multicast ,
- Gaussian Elimination ,
- Information Packets ,
- Alphabet Size
Contents Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Network Coding ,
- Random Networks ,
- Block Length ,
- Incomplete Gamma Function ,
- Linear Combination ,
- Optimal Rate ,
- Coefficient Vector ,
- Degree Distribution ,
- System Of Linear Equations ,
- Codeword ,
- Finite Length ,
- Random Code ,
- Decoding Process ,
- Linear Complexity ,
- Linear Code ,
- Multicast ,
- Gaussian Elimination ,
- Information Packets ,
- Alphabet Size
