A Binary Coding Approach for Combination Networks and General Erasure Networks

@article{Xiao2007ABC,
  title={A Binary Coding Approach for Combination Networks and General Erasure Networks},
  author={Ming Xiao and Muriel M{\'e}dard and Tor Aulin},
  journal={2007 IEEE International Symposium on Information Theory},
  year={2007},
  pages={786-790}
}
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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 33 CITATIONS

Circular-Shift Linear Network Codes With Arbitrary Odd Block Lengths

  • IEEE Transactions on Communications
  • 2018
VIEW 5 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Wireless Broadcasting With Network Coding

LU LU Licentiate
  • 2011
VIEW 9 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Efficient Wireless Broadcasting Based on Systematic Binary Deterministic Rateless Codes

  • 2010 IEEE International Conference on Communications
  • 2010
VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Circular-Shift Linear Network Coding

  • IEEE Transactions on Information Theory
  • 2019
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Circular-shift linear network coding

  • 2017 IEEE International Symposium on Information Theory (ISIT)
  • 2017
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Localized dimension growth in random network coding: A convolutional approach

  • 2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Systematic binary deterministic rateless codes

  • 2008 IEEE International Symposium on Information Theory
  • 2008
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Circular-shift Linear Network Codes with Arbitrary Odd Block Lengths

  • 2018 IEEE Information Theory Workshop (ITW)
  • 2018
VIEW 2 EXCERPTS
CITES BACKGROUND

Combination Networks With or Without Secrecy Constraints: The Impact of Caching Relays

  • IEEE Journal on Selected Areas in Communications
  • 2018
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES

Low Complexity Encoding for Network Codes

  • 2006 IEEE International Symposium on Information Theory
  • 2006
VIEW 2 EXCERPTS

and Z

R. W. Yeung, S.Y.R. Li, N. Cai
  • Zhang, "Network Coding Theory," Foundation and Trends in Communications and Information Theory, now Publishers, Hanover, MA. USA
  • 2006
VIEW 2 EXCERPTS

On average throughput and alphabet size in network coding

  • Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.
  • 2005
VIEW 1 EXCERPT

Some Classes of Quasi-Cyclic LDPC Codes: Properties and Efficient Encoding Method,

H. Fujita, K. Sakaniwa
  • IEICE Trans. on Fundamentals, vol. E88-A,
  • 2005
VIEW 2 EXCERPTS

Digital fountains: a survey and look forward

  • Information Theory Workshop
  • 2004
VIEW 3 EXCERPTS

and D

S. Lin
  • Costello, Jr. Error Control Coding, Prentice Hall
  • 2004
VIEW 2 EXCERPTS

Similar Papers

Loading similar papers…