Sub-rate linear network coding
Increasing network capacity is undoubtedly a critical aspect of modern communication systems. In this paper, the concept of sub-rate coding and decoding in the framework of linear network coding (LNC) is introduced for single-source multiple-sinks finite acyclic networks. This methodology offers a m...
Uložené v:
| Vydané v: | Computer communications Ročník 208; s. 271 - 282 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.08.2023
|
| Predmet: | |
| ISSN: | 0140-3664 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Increasing network capacity is undoubtedly a critical aspect of modern communication systems. In this paper, the concept of sub-rate coding and decoding in the framework of linear network coding (LNC) is introduced for single-source multiple-sinks finite acyclic networks. This methodology offers a modification to existing LNC so that the source transmits its messages in a manner in which a given set of sinks (termed sub-rate sinks), whose max-flow is smaller than the source’s message-rate, can still decode a portion of the transmitted messages, without degrading the maximum achievable rate of LNC sinks whose max-flow is equal (or greater) than the source rate. The paper sets the conditions which a set of sub-rate sinks has to satisfy in order for that methodology to be applicable. |
|---|---|
| AbstractList | Increasing network capacity is undoubtedly a critical aspect of modern communication systems. In this paper, the concept of sub-rate coding and decoding in the framework of linear network coding (LNC) is introduced for single-source multiple-sinks finite acyclic networks. This methodology offers a modification to existing LNC so that the source transmits its messages in a manner in which a given set of sinks (termed sub-rate sinks), whose max-flow is smaller than the source’s message-rate, can still decode a portion of the transmitted messages, without degrading the maximum achievable rate of LNC sinks whose max-flow is equal (or greater) than the source rate. The paper sets the conditions which a set of sub-rate sinks has to satisfy in order for that methodology to be applicable. |
| Author | Shrem, I. Amrani, O. Grinboim, B. |
| Author_xml | – sequence: 1 givenname: B. surname: Grinboim fullname: Grinboim, B. – sequence: 2 givenname: I. surname: Shrem fullname: Shrem, I. – sequence: 3 givenname: O. orcidid: 0000-0003-3144-8994 surname: Amrani fullname: Amrani, O. email: ofera@eng.tau.ac.il |
| BookMark | eNp9j0FLxDAUhHNYwd3VfyDSP9D60qapvQiyqCsseFDPIXl5ldTdRJKq-O_NUs_CwFxmhvlWbOGDJ8YuOFQcuLwaKwyHrKqGuqlAVgD9gi2BCygbKcUpW6U0AoDoumbJLp8_TRn1RMXeedKx8DR9h_heYLDOv52xk0HvE53_-Zq93t-9bLbl7unhcXO7K7Fu26m0rRStJSmhG8RwTYSWLNWmk9Rz3kOtLTfGcJSmwRwAbqXJB3otNEKHzZqJeRdjSCnSoD6iO-j4ozioI5ca1cyljlwKpMpcuXYz1yh_-3IUVUJHHsm6SDgpG9z_A78i01v0 |
| Cites_doi | 10.35834/2002/1402092 10.1109/TIT.2002.807285 10.14722/diss.2018.23010 10.1109/ITW.2006.322849 10.1109/TIT.2005.847712 10.1109/JIOT.2019.2906615 10.1109/COMST.2017.2665587 10.1109/18.850663 10.1007/978-3-031-18283-9_31 10.1109/TNET.2003.818197 |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier B.V. |
| Copyright_xml | – notice: 2023 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.comcom.2023.06.009 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EndPage | 282 |
| ExternalDocumentID | 10_1016_j_comcom_2023_06_009 S0140366423002074 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 4.4 457 4G. 5GY 5VS 7-5 71M 77K 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AATTM AAXKI AAXUO AAYFN ABBOA ABFNM ABJNI ABMAC ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE ADTZH AEBSH AECPX AEIPS AEKER AENEX AFJKZ AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AKRWK ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD AXJTR BJAXD BKOJK BLXMC BNPGV CS3 DU5 EBS EFJIC EO8 EO9 EP2 EP3 FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ IHE J1W JJJVA KOM LG9 M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 ROL RPZ RXW SDF SDG SDP SES SPC SPCBC SSH SST SSV SSZ T5K WH7 ZMT ~G- 07C 29F 77I 9DU AAQXK AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO AEUPX AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKYEP APXCP ASPBG AVWKF AZFZN CITATION EFKBS EFLBG EJD F0J FEDTE FGOYB HLZ HVGLF HZ~ R2- SBC SEW TAE UHS VH1 VOH WUQ XPP ZY4 ~HD |
| ID | FETCH-LOGICAL-c255t-d5645de6607f4f8eecdede2b76e911902ad1bbb1c6b3c4f801d6b4779a4ac07c3 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001031805800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0140-3664 |
| IngestDate | Sat Nov 29 07:25:10 EST 2025 Sun Apr 06 06:53:29 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Sub-rate decoding Linear broadcast Network coding Static network code Variable-rate network code Linear multicast Linear network coding |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c255t-d5645de6607f4f8eecdede2b76e911902ad1bbb1c6b3c4f801d6b4779a4ac07c3 |
| ORCID | 0000-0003-3144-8994 |
| PageCount | 12 |
| ParticipantIDs | crossref_primary_10_1016_j_comcom_2023_06_009 elsevier_sciencedirect_doi_10_1016_j_comcom_2023_06_009 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-08-01 2023-08-00 |
| PublicationDateYYYYMMDD | 2023-08-01 |
| PublicationDate_xml | – month: 08 year: 2023 text: 2023-08-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Computer communications |
| PublicationYear | 2023 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Panagiotis Chatzigiannis, Foteini Baldimtsi, Konstantinos Chalkias, Sok: Blockchain light clients, in: Ncial Cryptography and Data Security: 26th International Conference, FC 2022, 2022. Nicholas J. A. Harvey, Murota (b11) 2005 Alshwede, Cai, Li, Yeung (b1) 2000 Tian (b12) 2002 Sun (b13) 2018 Damian Gruber, Wenting Li, Ghassan Karame, Unifying lightweight blockchain client implementations, in: Proc. NDSS Workshop Decentralized IoT Security Stand, 2018. Yeung, Li, Cai (b8) 2006 Li, Yeung, Cai (b2) Feb. 2003; 49 Al-Naffouri, Douik, Sorour, Alouini (b15) 2017; 19 Jaggi (b10) 2005; 51 S. Fong, R. Yeung, Variable-rate linear network coding, in: IEEE Information Theory Workshop, 2006, pp. 409–412. Lai, Vora, Shah (b6) 2018 Koetter, Medard (b3) 2003 Danzi (b5) 2019 Ebrahimi, Fragouli (b9) 2010 Tian (10.1016/j.comcom.2023.06.009_b12) 2002 Koetter (10.1016/j.comcom.2023.06.009_b3) 2003 Danzi (10.1016/j.comcom.2023.06.009_b5) 2019 Alshwede (10.1016/j.comcom.2023.06.009_b1) 2000 Jaggi (10.1016/j.comcom.2023.06.009_b10) 2005; 51 10.1016/j.comcom.2023.06.009_b14 Ebrahimi (10.1016/j.comcom.2023.06.009_b9) 2010 Nicholas J. A. Harvey (10.1016/j.comcom.2023.06.009_b11) 2005 Yeung (10.1016/j.comcom.2023.06.009_b8) 2006 10.1016/j.comcom.2023.06.009_b7 Lai (10.1016/j.comcom.2023.06.009_b6) 2018 10.1016/j.comcom.2023.06.009_b4 Sun (10.1016/j.comcom.2023.06.009_b13) 2018 Al-Naffouri (10.1016/j.comcom.2023.06.009_b15) 2017; 19 Li (10.1016/j.comcom.2023.06.009_b2) 2003; 49 |
| References_xml | – year: 2006 ident: b8 article-title: Network Coding Theory (Foundations and Trends(R) in Communications and Information Theory) – volume: 19 start-page: 1201 year: 2017 end-page: 1224 ident: b15 article-title: Instantly decodable network coding: From centralized to device-to-device communications publication-title: IEEE Commun. Surv. Tutor. – year: 2003 ident: b3 article-title: An algebraic approach to network coding publication-title: IEEE/ACM Trans. Netw. – year: 2000 ident: b1 article-title: Network information flow: Single source publication-title: IEEE Trans. Inform. Theory – volume: 51 start-page: 1973 year: 2005 end-page: 1982 ident: b10 article-title: Polynomial time algorithms for multicast network code construction publication-title: IEEE Trans. Inform. Theory – reference: Panagiotis Chatzigiannis, Foteini Baldimtsi, Konstantinos Chalkias, Sok: Blockchain light clients, in: Ncial Cryptography and Data Security: 26th International Conference, FC 2022, 2022. – year: 2018 ident: b6 article-title: Empowering light nodes in blockchains with block summarization publication-title: IFIP International Conference on New Technologies, Mobility and Security – volume: 49 start-page: 371 year: Feb. 2003 ident: b2 article-title: Linear network coding publication-title: IEEE Trans. Inform. Theory – year: 2018 ident: b13 article-title: On construction of variable-rate and static linear network codes publication-title: IEEE Access – year: 2019 ident: b5 article-title: And communication tradeoffs for blockchain systems with lightweight IoT clients publication-title: IEEE Internet Things J. 6.2 – start-page: 2408 year: 2010 end-page: 2412 ident: b9 article-title: Vector network coding algorithms publication-title: 2010 IEEE International Symposium on Information Theory – start-page: 489 year: 2005 end-page: 498 ident: b11 article-title: Deterministic network coding by matrix completion publication-title: SODA ’05 – reference: S. Fong, R. Yeung, Variable-rate linear network coding, in: IEEE Information Theory Workshop, 2006, pp. 409–412. – reference: Damian Gruber, Wenting Li, Ghassan Karame, Unifying lightweight blockchain client implementations, in: Proc. NDSS Workshop Decentralized IoT Security Stand, 2018. – year: 2002 ident: b12 article-title: The dimension of intersection of k subspaces publication-title: Missouri J. Math. Sci. – year: 2002 ident: 10.1016/j.comcom.2023.06.009_b12 article-title: The dimension of intersection of k subspaces publication-title: Missouri J. Math. Sci. doi: 10.35834/2002/1402092 – year: 2018 ident: 10.1016/j.comcom.2023.06.009_b13 article-title: On construction of variable-rate and static linear network codes publication-title: IEEE Access – volume: 49 start-page: 371 year: 2003 ident: 10.1016/j.comcom.2023.06.009_b2 article-title: Linear network coding publication-title: IEEE Trans. Inform. Theory doi: 10.1109/TIT.2002.807285 – ident: 10.1016/j.comcom.2023.06.009_b7 doi: 10.14722/diss.2018.23010 – ident: 10.1016/j.comcom.2023.06.009_b14 doi: 10.1109/ITW.2006.322849 – start-page: 2408 year: 2010 ident: 10.1016/j.comcom.2023.06.009_b9 article-title: Vector network coding algorithms – start-page: 489 year: 2005 ident: 10.1016/j.comcom.2023.06.009_b11 article-title: Deterministic network coding by matrix completion – volume: 51 start-page: 1973 year: 2005 ident: 10.1016/j.comcom.2023.06.009_b10 article-title: Polynomial time algorithms for multicast network code construction publication-title: IEEE Trans. Inform. Theory doi: 10.1109/TIT.2005.847712 – year: 2006 ident: 10.1016/j.comcom.2023.06.009_b8 – year: 2019 ident: 10.1016/j.comcom.2023.06.009_b5 article-title: And communication tradeoffs for blockchain systems with lightweight IoT clients publication-title: IEEE Internet Things J. 6.2 doi: 10.1109/JIOT.2019.2906615 – volume: 19 start-page: 1201 issue: 2 year: 2017 ident: 10.1016/j.comcom.2023.06.009_b15 article-title: Instantly decodable network coding: From centralized to device-to-device communications publication-title: IEEE Commun. Surv. Tutor. doi: 10.1109/COMST.2017.2665587 – year: 2000 ident: 10.1016/j.comcom.2023.06.009_b1 article-title: Network information flow: Single source publication-title: IEEE Trans. Inform. Theory doi: 10.1109/18.850663 – ident: 10.1016/j.comcom.2023.06.009_b4 doi: 10.1007/978-3-031-18283-9_31 – year: 2018 ident: 10.1016/j.comcom.2023.06.009_b6 article-title: Empowering light nodes in blockchains with block summarization – year: 2003 ident: 10.1016/j.comcom.2023.06.009_b3 article-title: An algebraic approach to network coding publication-title: IEEE/ACM Trans. Netw. doi: 10.1109/TNET.2003.818197 |
| SSID | ssj0004773 |
| Score | 2.3744128 |
| Snippet | Increasing network capacity is undoubtedly a critical aspect of modern communication systems. In this paper, the concept of sub-rate coding and decoding in the... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 271 |
| SubjectTerms | Linear broadcast Linear multicast Linear network coding Network coding Static network code Sub-rate decoding Variable-rate network code |
| Title | Sub-rate linear network coding |
| URI | https://dx.doi.org/10.1016/j.comcom.2023.06.009 |
| Volume | 208 |
| WOSCitedRecordID | wos001031805800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0140-3664 databaseCode: AIEXJ dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0004773 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NT8IwFG8UPOjB-Bnxg-zgjYx0W7euRzSoGIMe0HBbtrYkkjjIQMOf7-u6bkQMkYOXZWu6du1vee-1_b33ELrGWMiRE3ObU4ltEhNix34g4DFmgXAoFrkf99sT7ffD4ZC9FGnZZ3k6AZqm4WLBpv8KNZQB2Mp1dgO4y0ahAO4BdLgC7HD9E_AgCmwV_6GlDMg4a6Wa6N3ik1JNmcgERUYHxSuvvERKI_s-U0c_OtvyTbvcigHw86JeWdT5yHRmqNZze3kXwfVKDlu1sQjyONARxY1kdHG4LNt0rpRCTbo6Z9CKBNabAWM1gYqOo_rKA6RiVmkcc8r-QxGV9EDDPBtHupVItRLlBDy2jeou9RnI4Hqn1x0-Vk6wVNMJzECMn2RO5lv9mt_tkCXbYnCA9otFgdXRYB6iLZkeob2lUJHHqGlgtTSsVgGrpWE9Qa933cHtg13ktrA5LOLmtlBRfIQMAkxHZBRKyYUU0k1oIEH9MOzGwkmSxOFB4nGogB0RJDBEFpOYY8q9U1RLJ6k8Q5bj-VArVEFhRyTxJPOJstNcSQRNXCIbyDYjjaY6hEm0boYbiJrpiAozTJtXEWC89s3zDXu6QLvVv3iJavPsU16hHf41f59lzQLgb5VOUhU |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Sub-rate+linear+network+coding&rft.jtitle=Computer+communications&rft.au=Grinboim%2C+B.&rft.au=Shrem%2C+I.&rft.au=Amrani%2C+O.&rft.date=2023-08-01&rft.issn=0140-3664&rft.volume=208&rft.spage=271&rft.epage=282&rft_id=info:doi/10.1016%2Fj.comcom.2023.06.009&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_comcom_2023_06_009 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0140-3664&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0140-3664&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0140-3664&client=summon |