Exact Decoding Probability Under Random Linear Network Coding
In this letter, we compute the exact probability that a receiver obtains N linearly independent packets among K ≥ N received packets, when the sender/s use/s random linear network coding over a Galois Field of size q. Such condition maps to the receiver's capability to decode the original infor...
Saved in:
Published in | IEEE communications letters Vol. 15; no. 1; pp. 67 - 69 |
---|---|
Main Authors | , , |
Format | Journal Article Publication |
Language | English |
Published |
New York, NY
IEEE
01.01.2011
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
ISSN | 1089-7798 1558-2558 |
DOI | 10.1109/LCOMM.2010.110310.101480 |
Cover
Abstract | In this letter, we compute the exact probability that a receiver obtains N linearly independent packets among K ≥ N received packets, when the sender/s use/s random linear network coding over a Galois Field of size q. Such condition maps to the receiver's capability to decode the original information, and its mathematical characterization helps to design the coding so to guarantee the correctness of the transmission. Our formulation represents an improvement over the current upper bound for the decoding probability, and provides theoretical grounding to simulative results in the literature. |
---|---|
AbstractList | In this letter, we compute the exact probability that a receiver obtains N linearly independent packets among K ≥ N received packets, when the sender/s use/s random linear network coding over a Galois Field of size q. Such condition maps to the receiver's capability to decode the original information, and its mathematical characterization helps to design the coding so to guarantee the correctness of the transmission. Our formulation represents an improvement over the current upper bound for the decoding probability, and provides theoretical grounding to simulative results in the literature. In this letter, we compute the exact probability that a receiver obtains N linearly independent packets among K greater than or equal to N received packets, when the sender/s use/s random linear network coding over a Galois Field of size q. Such condition maps to the receiver's capability to decode the original information, and its mathematical characterization helps to design the coding so to guarantee the correctness of the transmission. Our formulation represents an improvement over the current upper bound for the decoding probability, and provides theoretical grounding to simulative results in the literature. In this letter, we compute the exact probability that a receiver obtains N linearly independent packets among K ≥ N received packets, when the sender/s use/s random linear network coding over a Galois Field of size q. Such condition maps to the receiver's capability to decode the original information, and its mathematical characterization helps to design the coding so to guarantee the correctness of the transmission. Our formulation represents an improvement over the current upper bound for the decoding probability, and provides theoretical grounding to simulative results in the literature. Peer Reviewed |
Author | Trullols-Cruces, O Barcelo-Ordinas, J M Fiore, M |
Author_xml | – sequence: 1 givenname: O surname: Trullols-Cruces fullname: Trullols-Cruces, O email: trullols@ac.upc.edu organization: Dept. of Comput. Archit., Univ. Politec. de Catalunya (UPC), Barcelona, Spain – sequence: 2 givenname: J M surname: Barcelo-Ordinas fullname: Barcelo-Ordinas, J M email: joseb@ac.upc.edu organization: Dept. of Comput. Archit., Univ. Politec. de Catalunya (UPC), Barcelona, Spain – sequence: 3 givenname: M surname: Fiore fullname: Fiore, M email: marco.fiore@insa-lyon.fr organization: CITI Lab., Univ. de Lyon, Lyon, France |
BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23763881$$DView record in Pascal Francis https://inria.hal.science/inria-00613337$$DView record in HAL |
BookMark | eNqNkU1v1DAQhiNUJNrCL-ASISEOKGVsx459AKlaSouUUoTo2Ro7Drhk7dbOAv33TTbLHnriYM-M9LzzofeoOAgxuKIoCZwQAupdu7q6vDyhsNRsDkBqCU-KQ8K5rOj0HUw5SFU1jZLPiqOcbwBAUk4Oi_dnf9GO5UdnY-fDj_JrigaNH_x4X16HzqXyG4YursvWB4ep_OLGPzH9Kldb_HnxtMchuxe7eFxcfzr7vrqo2qvzz6vTtrJc0LGqGYOeO-4IVdaB7PoaCBNWIjJpGlMbDsYIah2jxoBCRTqclzWkmVLCjou3S9-fOOjb5NeY7nVEry9OW-1D8qgBBGGMNb9nmiy0zRurk7MuWRy3_L6YH4WGaqIY8FnzZtHcpni3cXnUa5-tGwYMLm6yloJwxhXIiXz1iLyJmxSm87WshaKCMTpBr3cQZotDnzBYn_erU9YIJuU89sNu1RRzTq7X1o84-hjGhH7QBPTsst66rGeX9eKyXlyeGshHDf7N-A_py0XqnXN7GResJlyxB6Z5s1c |
CODEN | ICLEF6 |
CitedBy_id | crossref_primary_10_1109_JCN_2013_000074 crossref_primary_10_1002_ett_3011 crossref_primary_10_1109_LCOMM_2015_2470662 crossref_primary_10_1145_3491062 crossref_primary_10_1002_sat_1220 crossref_primary_10_1007_s11277_019_06186_4 crossref_primary_10_1109_TCOMM_2019_2911578 crossref_primary_10_3390_e21090905 crossref_primary_10_1109_JSAC_2014_2384231 crossref_primary_10_1109_TVT_2021_3061047 crossref_primary_10_1109_LCOMM_2012_041112_112564 crossref_primary_10_1109_TVT_2012_2230283 crossref_primary_10_1002_sat_1056 crossref_primary_10_1007_s11859_015_1111_z crossref_primary_10_1109_TVT_2013_2265279 crossref_primary_10_3390_s20154334 crossref_primary_10_1109_ACCESS_2022_3175815 crossref_primary_10_1049_iet_net_2017_0232 crossref_primary_10_1109_TPDS_2012_101 crossref_primary_10_1109_TWC_2021_3129996 crossref_primary_10_1109_LCOMM_2015_2421448 crossref_primary_10_1109_TWC_2016_2615618 crossref_primary_10_1016_j_dsp_2021_103164 crossref_primary_10_1109_ACCESS_2023_3271889 crossref_primary_10_1109_TWC_2017_2764891 crossref_primary_10_1587_transcom_E95_B_3120 crossref_primary_10_1109_ACCESS_2023_3297137 crossref_primary_10_1109_TCOMM_2013_091413_120485 crossref_primary_10_1109_TVT_2017_2670178 crossref_primary_10_3390_electronics5040066 crossref_primary_10_1109_ACCESS_2018_2884408 crossref_primary_10_1109_JSEN_2014_2310899 crossref_primary_10_1016_j_phycom_2017_08_017 crossref_primary_10_1587_transcom_E98_B_1518 crossref_primary_10_1109_TVT_2016_2519140 crossref_primary_10_1109_LCOMM_2015_2432106 crossref_primary_10_1109_TGCN_2019_2929064 crossref_primary_10_1109_TVT_2020_3005409 crossref_primary_10_1007_s12083_021_01206_2 crossref_primary_10_1109_LWC_2021_3107314 crossref_primary_10_1109_TVT_2023_3316122 crossref_primary_10_1007_s11036_016_0731_7 crossref_primary_10_1109_LCOMM_2015_2449848 crossref_primary_10_3390_fi11080164 crossref_primary_10_1109_ACCESS_2017_2741972 crossref_primary_10_1155_2015_238386 crossref_primary_10_1109_TWC_2017_2708702 crossref_primary_10_1016_j_jvcir_2013_04_009 crossref_primary_10_1109_LNET_2020_2993255 crossref_primary_10_1016_j_comcom_2019_05_008 crossref_primary_10_1109_LCOMM_2013_062113_131139 crossref_primary_10_1109_LCOMM_2014_022714_140158 crossref_primary_10_1109_ACCESS_2021_3069077 crossref_primary_10_1016_j_comnet_2016_02_003 crossref_primary_10_1109_LWC_2018_2881157 crossref_primary_10_1109_LCOMM_2016_2623299 crossref_primary_10_1109_LCOMM_2020_3041845 crossref_primary_10_1109_TCE_2023_3340416 crossref_primary_10_1109_ACCESS_2019_2944232 crossref_primary_10_1109_LWC_2021_3110264 crossref_primary_10_1109_COMST_2016_2562027 crossref_primary_10_1109_TCOMM_2015_2503398 crossref_primary_10_1109_TCOMM_2016_2630062 crossref_primary_10_1155_2015_394956 crossref_primary_10_3390_info9040072 crossref_primary_10_1016_j_comcom_2013_09_006 crossref_primary_10_1049_ell2_12858 crossref_primary_10_1109_LCOMM_2012_011312_111576 crossref_primary_10_1109_LWC_2019_2902541 crossref_primary_10_1109_TCOMM_2017_2657621 crossref_primary_10_14529_jcem200201 crossref_primary_10_1109_LCOMM_2017_2704110 crossref_primary_10_1002_dac_3574 crossref_primary_10_1109_ACCESS_2019_2907005 crossref_primary_10_1109_TCOMM_2018_2801791 crossref_primary_10_1109_TBC_2019_2892594 crossref_primary_10_1109_TCOMM_2014_2330825 crossref_primary_10_1109_TWC_2020_2979145 crossref_primary_10_1109_LCOMM_2013_091113_131361 |
Cites_doi | 10.1109/GLOCOM.2009.5425257 10.1145/1080139.1080147 10.1109/INFCOM.2009.5062100 10.1109/18.850663 10.1109/TIT.2006.881746 |
ContentType | Journal Article Publication |
Contributor | Universitat Politècnica de Catalunya. CNDS - Xarxes de Computadors i Sistemes Distribuïts Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors |
Contributor_xml | – sequence: 1 fullname: Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors – sequence: 2 fullname: Universitat Politècnica de Catalunya. CNDS - Xarxes de Computadors i Sistemes Distribuïts |
Copyright | 2015 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2011 info:eu-repo/semantics/openAccess Distributed under a Creative Commons Attribution 4.0 International License |
Copyright_xml | – notice: 2015 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2011 – notice: info:eu-repo/semantics/openAccess – notice: Distributed under a Creative Commons Attribution 4.0 International License |
DBID | 97E RIA RIE AAYXX CITATION IQODW 7SP 8FD L7M F28 FR3 XX2 1XC |
DOI | 10.1109/LCOMM.2010.110310.101480 |
DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Engineering Research Database Recercat Hyper Article en Ligne (HAL) |
DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
DatabaseTitleList | Engineering Research Database Technology Research Database |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Applied Sciences Computer Science |
EISSN | 1558-2558 |
EndPage | 69 |
ExternalDocumentID | oai_HAL_inria_00613337v1 oai_recercat_cat_2072_193051 2246774831 23763881 10_1109_LCOMM_2010_110310_101480 5634159 |
Genre | orig-research |
GroupedDBID | -~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV AZLTO BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IES IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS TN5 VH1 AAYOK AAYXX CITATION RIG IQODW 7SP 8FD L7M F28 FR3 XX2 1XC |
ID | FETCH-LOGICAL-c562t-4330f5e5e129ce08df40136c8aa38b7b4b50bb62ce32bb09a91da7798b1791d13 |
IEDL.DBID | RIE |
ISSN | 1089-7798 |
IngestDate | Fri May 09 12:22:50 EDT 2025 Fri Sep 05 18:00:46 EDT 2025 Fri Sep 05 07:04:34 EDT 2025 Mon Jun 30 10:24:23 EDT 2025 Mon Jul 21 09:13:16 EDT 2025 Thu Apr 24 23:08:14 EDT 2025 Tue Jul 01 04:15:41 EDT 2025 Wed Aug 27 02:48:13 EDT 2025 |
IsDoiOpenAccess | true |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 1 |
Keywords | Finite field Upper bound Linear coding Grounding Wireless telecommunication error control Wireless network wireless networks Decoding Random coding Random linear network coding |
Language | English |
License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c562t-4330f5e5e129ce08df40136c8aa38b7b4b50bb62ce32bb09a91da7798b1791d13 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
OpenAccessLink | https://recercat.cat/handle/2072/193051 |
PQID | 846926332 |
PQPubID | 85419 |
PageCount | 3 |
ParticipantIDs | proquest_journals_846926332 proquest_miscellaneous_861535908 crossref_primary_10_1109_LCOMM_2010_110310_101480 hal_primary_oai_HAL_inria_00613337v1 csuc_recercat_oai_recercat_cat_2072_193051 crossref_citationtrail_10_1109_LCOMM_2010_110310_101480 pascalfrancis_primary_23763881 ieee_primary_5634159 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2011-January 2011-01-00 2011 20110101 2011-01 |
PublicationDateYYYYMMDD | 2011-01-01 |
PublicationDate_xml | – month: 01 year: 2011 text: 2011-January |
PublicationDecade | 2010 |
PublicationPlace | New York, NY |
PublicationPlace_xml | – name: New York, NY – name: New York |
PublicationTitle | IEEE communications letters |
PublicationTitleAbbrev | COML |
PublicationYear | 2011 |
Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
References | ref2 ref1 ref4 ho (ref3) 2004 ref6 ref5 |
References_xml | – year: 2004 ident: ref3 article-title: On the utility of network coding in dynamic environments publication-title: Oulu Finland IWWAN'04 – ident: ref6 doi: 10.1109/GLOCOM.2009.5425257 – ident: ref4 doi: 10.1145/1080139.1080147 – ident: ref5 doi: 10.1109/INFCOM.2009.5062100 – ident: ref1 doi: 10.1109/18.850663 – ident: ref2 doi: 10.1109/TIT.2006.881746 |
SSID | ssj0008251 |
Score | 2.3910768 |
Snippet | In this letter, we compute the exact probability that a receiver obtains N linearly independent packets among K ≥ N received packets, when the sender/s use/s... In this letter, we compute the exact probability that a receiver obtains N linearly independent packets among K greater than or equal to N received packets,... |
SourceID | hal csuc proquest pascalfrancis crossref ieee |
SourceType | Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
StartPage | 67 |
SubjectTerms | Applied sciences Coding Coding, codes Computer networks Computer Science Computer simulation Decoding Encoding Enginyeria de la telecomunicació error control Exact sciences and technology Galois fields Implementació Information, signal and communications theory Mathematical analysis Mathematical models Network coding Networking and Internet Architecture Networks Random linear network coding Receivers Signal and communications theory Telecommunications and information theory Telemàtica i xarxes d'ordinadors Upper bound Vectors Wireless communication systems wireless networks Xarxes sense fils Àrees temàtiques de la UPC |
Title | Exact Decoding Probability Under Random Linear Network Coding |
URI | https://ieeexplore.ieee.org/document/5634159 https://www.proquest.com/docview/846926332 https://www.proquest.com/docview/861535908 https://recercat.cat/handle/2072/193051 https://inria.hal.science/inria-00613337 |
Volume | 15 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3db9MwELe2PsEDAwYiG0x-2BMinRM7afzAw1Q2VWgdCDFpb5btXMQEpKhNEPDXc2en0fh4mNRKrXLuh8---138uzvGjgFRsixtloJsXKqczVPtNaQKpGqchdo6SnBeXpaLK_X2urjeYa_GXBgACOQzmNLLcJZfr3xPt8pOihJtbqF32S4us5irNVpdSsGMZHqNiFFXW9aO0CcX83fLZWRxZdTVIISsigpB3nJFE7_pPTqYT8SHDI1WiCZpNzhTTWxx8Y-1Di7ofI8ttz8-Mk8-T_vOTf2vv-o63vXfPWQPBizKT-PiecR2oH3M7t-qULjPXp_9sL7jbzBIJSfH369x_wc-7U8eWibxD7atV185xrS4Z_hlZJXzeRB_wq7Ozz7OF-nQcSH1iIM6Sp8STQEFIArwIKq6ofCr9JW1snIzp1whnCtzDzJ3Tmirs9rSbDuqclpn8imbtKsWnjFeWl94K0DkUCilhFVAp8JoPjzGxE2TsNl28o0fypFTV4wvJoQlQpugNkNqM1FtJqotYdk48lssyXGHMS9Jvwa9CKy97QxV1R7f0DMXs9wgmkUjlbBjXAXjZ5Po4vTC3LRoEgxhPinl7DuK7ZMSR7lBfwk7-mPZjNeJfySrCscdbteRGQzGxiAM1HkpZZ4wPl7FnU7HN7aFVY8ihM2pRf3B_7_4kN2LN7zp8ZxNunUPLxAxde4obJXfYewNbQ |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3db9MwELdGeQAe-BpoYTDysCdEOid20viBh6lsKtAWhDZpb5btXARipKhNEPDXc2en0fh4mNRKrXLuh8---138uzvGDgFRsihMmoCobSKtyRLlFCQShKytgcpYSnBeLIvZuXx7kV_ssJdDLgwAePIZjOmlP8uvVq6jW2VHeYE2N1c32E30-zIP2VqD3aUkzECnV4gZVbnl7XB1NJ--XywCjyulvgY-aJVUCvKKMxq5TefQxXwiRqRvtUJESbPBuapDk4t_7LV3Qqf32GL78wP35Mu4a-3Y_fqrsuN1_999drdHo_FxWD4P2A40D9mdKzUKd9mrkx_GtfFrDFPJzcUf1mgBPKP2Z-ybJsUfTVOtvsYY1eKuiZeBVx5Pvfgjdn56cjadJX3PhcQhEmopgYrXOeSAOMABL6uaArDClcaI0k6stDm3tsgciMxaroxKK0OzbanOaZWKx2zUrBrYY3FhXO4MB55BLqXkRgKdC6MBcRgV13XEJtvJ164vSE59MS61D0y40l5tmtSmg9p0UFvE0mHkt1CU4xpjXpB-NfoRWDvTaqqrPbyhZ8YnmUY8i2YqYoe4CobPJtHZ8Vx_btAoaEJ9QojJdxTbJSUOcr3-Inbwx7IZrhMDSZQljtvfriPdm4yNRiCoskKILGLxcBX3Oh3gmAZWHYoQOqcm9U_-_8XP2a3Z2WKu52-W7_bZ7XD7mx5P2ahdd_AM8VNrD_y2-Q2hCBC6 |
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=Exact+Decoding+Probability+Under+Random+Linear+Network+Coding&rft.jtitle=IEEE+communications+letters&rft.au=TRULLOLS-CRUCES%2C+Oscar&rft.au=BARCELO-ORDINAS%2C+Jose+M&rft.au=FIORE%2C+Marco&rft.date=2011&rft.pub=Institute+of+Electrical+and+Electronics+Engineers&rft.issn=1089-7798&rft.volume=15&rft.issue=1&rft.spage=67&rft.epage=69&rft_id=info:doi/10.1109%2FLCOMM.2010.110310.101480&rft.externalDBID=n%2Fa&rft.externalDocID=23763881 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-7798&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-7798&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-7798&client=summon |