Guessing Random Additive Noise Decoding of Network Coded Data Transmitted Over Burst Error Channels
We consider a transmitter that encodes data packets using network coding and broadcasts coded packets. A receiver employing network decoding recovers the data packets if a sufficient number of error-free coded packets are gathered. The receiver does not abandon its efforts to recover the data packet...
Saved in:
| Published in: | IEEE transactions on vehicular technology Vol. 73; no. 9; pp. 12842 - 12857 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.09.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 0018-9545, 1939-9359 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We consider a transmitter that encodes data packets using network coding and broadcasts coded packets. A receiver employing network decoding recovers the data packets if a sufficient number of error-free coded packets are gathered. The receiver does not abandon its efforts to recover the data packets if network decoding is unsuccessful; instead, it employs syndrome decoding (SD) in an effort to repair erroneous received coded packets, and then reattempts network decoding. Most decoding techniques, including SD, assume that errors are independently and identically distributed within received coded packets. Motivated by the guessing random additive noise decoding (GRAND) framework, we propose transversal GRAND (T-GRAND): an algorithm that exploits statistical dependence in the occurrence of errors, complements network decoding and recovers all data packets with a higher probability than SD. T-GRAND examines error vectors in order of their likelihood of occurring and altering the transmitted packets. Calculation and sorting of the likelihood values of all error vectors is a simple but computationally expensive process. To reduce the complexity of T-GRAND, we take advantage of the properties of the likelihood function and develop an efficient method, which identifies the most likely error vectors without computing and ordering all likelihood values. |
|---|---|
| AbstractList | We consider a transmitter that encodes data packets using network coding and broadcasts coded packets. A receiver employing network decoding recovers the data packets if a sufficient number of error-free coded packets are gathered. The receiver does not abandon its efforts to recover the data packets if network decoding is unsuccessful; instead, it employs syndrome decoding (SD) in an effort to repair erroneous received coded packets, and then reattempts network decoding. Most decoding techniques, including SD, assume that errors are independently and identically distributed within received coded packets. Motivated by the guessing random additive noise decoding (GRAND) framework, we propose transversal GRAND (T-GRAND): an algorithm that exploits statistical dependence in the occurrence of errors, complements network decoding and recovers all data packets with a higher probability than SD. T-GRAND examines error vectors in order of their likelihood of occurring and altering the transmitted packets. Calculation and sorting of the likelihood values of all error vectors is a simple but computationally expensive process. To reduce the complexity of T-GRAND, we take advantage of the properties of the likelihood function and develop an efficient method, which identifies the most likely error vectors without computing and ordering all likelihood values. |
| Author | Chatzigeorgiou, Ioannis Savostyanov, Dmitry |
| Author_xml | – sequence: 1 givenname: Ioannis orcidid: 0000-0001-6802-3434 surname: Chatzigeorgiou fullname: Chatzigeorgiou, Ioannis email: i.chatzigeorgiou@lancaster.ac.uk organization: School of Computing and Communications, Lancaster University, Lancaster, U.K – sequence: 2 givenname: Dmitry orcidid: 0000-0001-9994-1342 surname: Savostyanov fullname: Savostyanov, Dmitry email: d.savostyanov@essex.ac.uk organization: School of Mathematics, Statistics and Actuarial Science, University of Essex, Colchester, U.K |
| BookMark | eNp9kT1PAzEMhiNUJFpgZ2CIxHwlH3e5ywgtXxJqJVRYT7nEB4E2KUkK4t-TqgyIgcmy_T62_HqEBs47QOiEkjGlRJ4vnhZjRlg55rzhVSn20JBKLgvJKzlAQ0JoU8iqrA7QKMbXnJalpEOkbzYQo3XP-EE541f4whib7AfgmbcR8BS0N9u27_EM0qcPb3jiDRg8VUnhRVAurmxKuTD_gIAvNyEmfBWCD3jyopyDZTxC-71aRjj-iYfo8fpqMbkt7uc3d5OL-0IzyVJBK9ExyjvZlI2pSS06UJ1hWmuqG0YaYNQwWXEhK0IqI0ojMlH30Dc1U6Ljh-hsN3cd_Hs-K7WvfhNcXtlySkSmpJRZJXYqHXyMAfpW26SS9S4FZZctJe3W0DYb2m4NbX8MzSD5A66DXanw9R9yukMsAPySl02dP8C_AaOOgnA |
| CODEN | ITVTAB |
| CitedBy_id | crossref_primary_10_1109_OJCOMS_2025_3577007 |
| Cites_doi | 10.1109/ACCESS.2019.2907005 10.1109/GLOBECOM54140.2023.10437145 10.1007/s003650010032 10.1109/TCOMM.2014.021614.130172 10.1109/TIT.1968.1054129 10.1109/VETECS.2010.5494176 10.1109/ISIT.2018.8437648 10.1109/ICASSP39728.2021.9414615 10.1109/GCWkshps56602.2022.10008608 10.1109/TVLSI.2022.3153605 10.1109/ICASSP.2001.940517 10.1109/18.45284 10.1109/TIT.2006.881746 10.1007/978-3-319-25479-1_21 10.1145/1143549.1143654 10.1109/TNET.2014.2300140 10.1109/INFOCOM.2008.283 10.1109/TCOMM.2021.3114764 10.1109/GCWkshps56602.2022.10008698 10.1109/ISIT50566.2022.9834692 10.1002/j.1538-7305.1960.tb03959.x 10.1109/TCOMM.2022.3171798 10.1109/TCOMM.2016.2582487 10.1109/TIT.2019.2896110 10.1002/j.1538-7305.1963.tb00955.x 10.1109/TCOMM.2016.2622700 10.1109/TVT.2019.2925187 10.1109/TMAG.2018.2866297 10.1109/GLOBECOM46510.2021.9685645 10.1109/VETECS.2011.5956272 10.1109/GLOBECOM48099.2022.10001707 10.1145/512274.512284 10.1145/285243.285258 10.1109/TCOMM.2022.3220867 10.1109/LCOMM.2023.3285404 10.1109/TVT.2020.3004720 10.1109/ICC.2014.6884247 10.1007/978-3-031-31663-0 10.1109/TVT.2018.2844350 10.1109/LCOMM.2022.3227593 10.1109/ISITA.2008.4895567 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024 |
| DBID | 97E RIA RIE AAYXX CITATION 7SP 8FD FR3 KR7 L7M |
| DOI | 10.1109/TVT.2024.3383546 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Electronics & Communications Abstracts Technology Research Database Engineering Research Database Civil Engineering Abstracts Advanced Technologies Database with Aerospace |
| DatabaseTitle | CrossRef Civil Engineering Abstracts Engineering Research Database Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts |
| DatabaseTitleList | Civil Engineering Abstracts |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1939-9359 |
| EndPage | 12857 |
| ExternalDocumentID | 10_1109_TVT_2024_3383546 10487001 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Leverhulme Trust Fellowship grantid: RF-2021-258 |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAIKC AAJGR AAMNW AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS RXW TAE TN5 VH1 AAYXX CITATION 7SP 8FD FR3 KR7 L7M |
| ID | FETCH-LOGICAL-c292t-156b213b9848d7076beabd2ccc1c8208e21d2953695005d64d656b7fef872a6b3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001317694500037&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9545 |
| IngestDate | Mon Jun 30 10:16:30 EDT 2025 Tue Nov 18 22:18:20 EST 2025 Sat Nov 29 02:59:14 EST 2025 Wed Aug 27 01:59:02 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 9 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c292t-156b213b9848d7076beabd2ccc1c8208e21d2953695005d64d656b7fef872a6b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-9994-1342 0000-0001-6802-3434 |
| PQID | 3106500999 |
| PQPubID | 85454 |
| PageCount | 16 |
| ParticipantIDs | crossref_primary_10_1109_TVT_2024_3383546 proquest_journals_3106500999 ieee_primary_10487001 crossref_citationtrail_10_1109_TVT_2024_3383546 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-09-01 |
| PublicationDateYYYYMMDD | 2024-09-01 |
| PublicationDate_xml | – month: 09 year: 2024 text: 2024-09-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on vehicular technology |
| PublicationTitleAbbrev | TVT |
| PublicationYear | 2024 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref35 ref12 ref15 ref37 ref14 ref36 ref31 ref30 ref11 ref33 ref10 ref32 ref2 Cloud (ref4) 2013 ref1 Zhu (ref21) 2020 ref17 ref39 ref16 ref38 ref19 ref18 Williams (ref34) 1964; 7 ref24 ref23 ref26 ref25 ref20 ref42 ref41 ref22 ref43 ref28 (ref44) 2005 ref27 ref29 ref8 ref7 ref9 ref3 ref6 ref5 ref40 |
| References_xml | – ident: ref35 doi: 10.1109/ACCESS.2019.2907005 – ident: ref40 doi: 10.1109/GLOBECOM54140.2023.10437145 – ident: ref24 doi: 10.1007/s003650010032 – ident: ref30 doi: 10.1109/TCOMM.2014.021614.130172 – ident: ref41 doi: 10.1109/TIT.1968.1054129 – ident: ref37 doi: 10.1109/VETECS.2010.5494176 – ident: ref10 doi: 10.1109/ISIT.2018.8437648 – ident: ref14 doi: 10.1109/ICASSP39728.2021.9414615 – ident: ref15 doi: 10.1109/GCWkshps56602.2022.10008608 – ident: ref20 doi: 10.1109/TVLSI.2022.3153605 – ident: ref32 doi: 10.1109/ICASSP.2001.940517 – ident: ref33 doi: 10.1109/18.45284 – ident: ref1 doi: 10.1109/TIT.2006.881746 – ident: ref27 doi: 10.1007/978-3-319-25479-1_21 – ident: ref39 doi: 10.1145/1143549.1143654 – ident: ref5 doi: 10.1109/TNET.2014.2300140 – year: 2005 ident: ref44 article-title: Multimedia broadcast/multicast services, architecture and functional description – ident: ref23 doi: 10.1109/INFOCOM.2008.283 – ident: ref29 doi: 10.1109/TCOMM.2021.3114764 – ident: ref18 doi: 10.1109/GCWkshps56602.2022.10008698 – ident: ref22 doi: 10.1109/ISIT50566.2022.9834692 – ident: ref25 doi: 10.1002/j.1538-7305.1960.tb03959.x – ident: ref16 doi: 10.1109/TCOMM.2022.3171798 – ident: ref9 doi: 10.1109/TCOMM.2016.2582487 – ident: ref11 doi: 10.1109/TIT.2019.2896110 – ident: ref26 doi: 10.1002/j.1538-7305.1963.tb00955.x – start-page: 175 volume-title: Proc. Int. Symp. Inf. Theory Appl. year: 2020 ident: ref21 article-title: Decoder error propagation mitigation for spatially coupled LDPC codes – ident: ref28 doi: 10.1109/TCOMM.2016.2622700 – ident: ref6 doi: 10.1109/TVT.2019.2925187 – ident: ref31 doi: 10.1109/TMAG.2018.2866297 – start-page: 1 volume-title: Proc. IEEE 78th Veh. Technol. Conf. year: 2013 ident: ref4 article-title: Multipath-TCP with network coding for mobile devices in heterogeneous networks – ident: ref13 doi: 10.1109/GLOBECOM46510.2021.9685645 – ident: ref38 doi: 10.1109/VETECS.2011.5956272 – ident: ref19 doi: 10.1109/GLOBECOM48099.2022.10001707 – volume: 7 start-page: 347 issue: 6 year: 1964 ident: ref34 article-title: Algorithm 232heapsort publication-title: Commun. ACM doi: 10.1145/512274.512284 – ident: ref2 doi: 10.1145/285243.285258 – ident: ref36 doi: 10.1109/TCOMM.2022.3220867 – ident: ref12 doi: 10.1109/LCOMM.2023.3285404 – ident: ref7 doi: 10.1109/TVT.2020.3004720 – ident: ref8 doi: 10.1109/ICC.2014.6884247 – ident: ref43 doi: 10.1007/978-3-031-31663-0 – ident: ref3 doi: 10.1109/TVT.2018.2844350 – ident: ref17 doi: 10.1109/LCOMM.2022.3227593 – ident: ref42 doi: 10.1109/ISITA.2008.4895567 |
| SSID | ssj0014491 |
| Score | 2.45304 |
| Snippet | We consider a transmitter that encodes data packets using network coding and broadcasts coded packets. A receiver employing network decoding recovers the data... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 12842 |
| SubjectTerms | Additive noise Algorithms Burst noise Decoding Encoding Error reduction guessing random additive noise decoding (GRAND) Iterative decoding Linear codes Maximum likelihood decoding network coding network decoding Packets (communication) random linear coding Receivers Statistical analysis syndrome decoding Vectors |
| Title | Guessing Random Additive Noise Decoding of Network Coded Data Transmitted Over Burst Error Channels |
| URI | https://ieeexplore.ieee.org/document/10487001 https://www.proquest.com/docview/3106500999 |
| Volume | 73 |
| WOSCitedRecordID | wos001317694500037&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: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1939-9359 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014491 issn: 0018-9545 databaseCode: RIE dateStart: 19670101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT4NAEN6o8aAHnzVWq9mDFw-0sF1YOPpo9YTGVOON7AvTxIKh1N_vzEJNE6OJNw67hPDtMN8w38wQcmGlbyMVRF5sZe7xcBh5ElWEivEwVtgaNzBu2IRI0_j1NXlsi9VdLYy11onPbB8vXS7flHqBv8rAwoFe-1ittS5E1BRrfacMOG_H4wVgwcALljlJPxlMXiYQCTLex3gsRK674oPcUJUfX2LnXsa7_3ywPbLT8kh61QC_T9ZscUC2V7oLHhJ9t0CNa_FGn2Rhyhm9MsYphWhaTueW3kLkiZ6LljlNGzU4vSmNNfRW1pI6Lzab1kBJ6QMceHq9AKZIR1VVVhSLEgpwqx3yPB5Nbu69dqaCp1nCag_CNcWCoUpiHhvhi0hZqQzTWgcayEBsWWAYpnSTEOzTRNwA4VMit3ksmIzU8IhsFGVhjwkVvoklRC9cYwsbQJwDt9LWyJBrgFl0yWD5ljPdNhzHuRfvmQs8_CQDXDLEJWtx6ZLL7x0fTbONP9Z2EIeVdQ0EXdJbIpm15jjPgMMCE0UyfPLLtlOyhXdv1GM9slFXC3tGNvVnPZ1X5-6kfQH4ms8_ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF6kCurBt1itugcvHlKT7eZ1rPVRUaNIFW9hX5WCTSRN_f3ObFIpiIK3HHZJyLeT-SbzzQwhJ0a4JpBe4ERGDB3udwJHoIpQMu5HElvjetoOmwiTJHp9jR_rYnVbC2OMseIz08ZLm8vXuZrirzKwcKDXLlZrLfqcM7cq1_pOGnBeD8jzwIaBGcyykm58NngZQCzIeBsjMh_Z7pwXsmNVfnyLrYO5Wv_no22QtZpJ0m4F_SZZMNkWWZ3rL7hN1PUUVa7ZG30Smc7HtKu11QrRJB9NDL2A2BN9F82HNKn04LSXa6PphSgFtX5sPCqBlNIHOPL0fApckV4WRV5QLEvIwLHukOery0Gv79RTFRzFYlY6ELBJ5nVkHPFIh24YSCOkZkopTwEdiAzzNMOkbuyDheqAa6B8MhyaYRQyEcjOLmlkeWb2CA1dHQmIX7jCJjaAOQd2pYwWPlcAdNgkZ7O3nKq65ThOvnhPbejhxingkiIuaY1Lk5x-7_io2m38sXYHcZhbV0HQJK0ZkmltkJMUWCxwUaTD-79sOybL_cH9XXp3k9wekBW8U6Ula5FGWUzNIVlSn-VoUhzZU_cF6oXShg |
| 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=Guessing+Random+Additive+Noise+Decoding+of+Network+Coded+Data+Transmitted+Over+Burst+Error+Channels&rft.jtitle=IEEE+transactions+on+vehicular+technology&rft.au=Chatzigeorgiou%2C+Ioannis&rft.au=Savostyanov%2C+Dmitry&rft.date=2024-09-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9545&rft.eissn=1939-9359&rft.volume=73&rft.issue=9&rft.spage=12842&rft_id=info:doi/10.1109%2FTVT.2024.3383546&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9545&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9545&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9545&client=summon |