Bounds on Linear Codes for Network Multicast

@article{Feder2003BoundsOL,
  title={Bounds on Linear Codes for Network Multicast},
  author={Meir Feder and Dana Ron and Ami Tavory},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2003},
  volume={10}
}
Traditionally, communication networks are composed of routing nodes, which relay and duplicate data. Work in recent years has shown that for the case of multicast, an improvement in both rate and code-construction complexity can be gained by replacing these routing nodes by linear coding nodes. These nodes transmit linear combinations of the inputs transmitted to them. In this work, we deal with bounds on the alphabet size and amount of coding necessary for linear codes for multicast. We show… CONTINUE READING
Highly Cited
This paper has 87 citations. REVIEW CITATIONS
50 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 50 extracted citations

87 Citations

051015'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 87 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Communication over an unknown channel via common broadcasting

  • N. Shulman, M. Feder
  • Ph.D. dissertation, Faculty of EE - Systems, Tel…
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…