Skip to content
Free planNo credit card requiredStart writing

preprint · arXiv (Cornell University) · 2022

Sub-Rate Linear Network Coding

Ben Grinboim, Itay Shrem, Ofer Amrani

Cited by 0Open access

Abstract

Increasing network utilization is often considered as the holy grail of communications. In this article, the concept of sub-rate coding and decoding in the framework of linear network coding (LNC) is discussed for single-source multiple-sinks finite acyclic networks. Sub-rate coding offers an add-on to existing LNC. It allows sinks whose max-flow is smaller than the source message-rate, termed \emph{sub-rate sinks}, to decode a portion of the transmitted message without degrading the maximum achievable rate of LNC sinks whose max-flow is equal (or greater) than the rate of the source node. The article studies theoretical aspects of sub-rate coding by formulating the conditions a node (and indeed the network) must fulfill so as to qualify as a legitimate sub-rate sink.

Cite this paper

APA 7

Grinboim, B., Shrem, I., & Amrani, O. (2022). Sub-Rate Linear Network Coding. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2205.13431

MLA 9

Grinboim, Ben, et al. “Sub-Rate Linear Network Coding.” arXiv (Cornell University), 2022, https://doi.org/10.48550/arxiv.2205.13431.

Chicago

Grinboim, Ben, Itay Shrem, and Ofer Amrani. 2022. “Sub-Rate Linear Network Coding.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2205.13431.

Harvard

Grinboim, B., Shrem, I. and Amrani, O. (2022) ‘Sub-Rate Linear Network Coding’, arXiv (Cornell University). Available at: https://doi.org/10.48550/arxiv.2205.13431.

BibTeX
@misc{grinboim2022rate,
  title = {{Sub-Rate Linear Network Coding}},
  author = {Grinboim, Ben and Shrem, Itay and Amrani, Ofer},
  journal = {arXiv (Cornell University)},
  year = {2022},
  doi = {10.48550/arxiv.2205.13431}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.