On the Capacity of Multiplicative Finite-Field Matrix Channels
This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless channel whose input and output are matrices (over a finite field) related by a multiplicative transfer matrix. The model considered here assumes that all transfer matrices with the same rank are equiprobable,...
Uloženo v:
| Vydáno v: | IEEE transactions on information theory Ročník 59; číslo 8; s. 4949 - 4960 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY
IEEE
01.08.2013
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 0018-9448, 1557-9654 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless channel whose input and output are matrices (over a finite field) related by a multiplicative transfer matrix. The model considered here assumes that all transfer matrices with the same rank are equiprobable, so that the channel is completely characterized by the rank distribution of the transfer matrix. This model is seen to be more flexible than previously proposed ones in describing random linear network coding systems subject to link erasures, while still being sufficiently simple to allow tractability. The model is also conservative in the sense that its capacity provides a lower bound on the capacity of any channel with the same rank distribution. A main contribution is to express the channel capacity as the solution of a convex optimization problem which can be easily solved by numerical computation. For the special case of constant-rank input, a closed-form expression for the capacity is obtained. The behavior of the channel for asymptotically large field size or packet length is studied, and it is shown that constant-rank input suffices in this case. Finally, it is proved that the well-known approach of treating inputs and outputs as subspaces is information-lossless even in this more general model. |
|---|---|
| AbstractList | This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless channel whose input and output are matrices (over a finite field) related by a multiplicative transfer matrix. The model considered here assumes that all transfer matrices with the same rank are equiprobable, so that the channel is completely characterized by the rank distribution of the transfer matrix. This model is seen to be more flexible than previously proposed ones in describing random linear network coding systems subject to link erasures, while still being sufficiently simple to allow tractability. The model is also conservative in the sense that its capacity provides a lower bound on the capacity of any channel with the same rank distribution. A main contribution is to express the channel capacity as the solution of a convex optimization problem which can be easily solved by numerical computation. For the special case of constant-rank input, a closed-form expression for the capacity is obtained. The behavior of the channel for asymptotically large field size or packet length is studied, and it is shown that constant-rank input suffices in this case. Finally, it is proved that the well-known approach of treating inputs and outputs as subspaces is information-lossless even in this more general model. This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless channel whose input and output are matrices (over a finite field) related by a multiplicative transfer matrix. The model considered here assumes that all transfer matrices with the same rank are equiprobable, so that the channel is completely characterized by the rank distribution of the transfer matrix. This model is seen to be more flexible than previously proposed ones in describing random linear network coding systems subject to link erasures, while still being sufficiently simple to allow tractability. The model is also conservative in the sense that its capacity provides a lower bound on the capacity of any channel with the same rank distribution. A main contribution is to express the channel capacity as the solution of a convex optimization problem which can be easily solved by numerical computation. For the special case of constant-rank input, a closed-form expression for the capacity is obtained. The behavior of the channel for asymptotically large field size or packet length is studied, and it is shown that constant-rank input suffices in this case. Finally, it is proved that the well-known approach of treating inputs and outputs as subspaces is information-lossless even in this more general model. [PUBLICATION ABSTRACT] |
| Author | Uchoa-Filho, Bartolomeu F. Nobrega, Roberto W. Silva, Danilo |
| Author_xml | – sequence: 1 givenname: Roberto W. surname: Nobrega fullname: Nobrega, Roberto W. email: rwnobrega@eel.ufsc.br organization: Dept. of Electr. Eng., Fed. Univ. of Santa Catarina, Florianopolis, Brazil – sequence: 2 givenname: Danilo surname: Silva fullname: Silva, Danilo email: danilo@eel.ufsc.br organization: Dept. of Electr. Eng., Fed. Univ. of Santa Catarina, Florianopolis, Brazil – sequence: 3 givenname: Bartolomeu F. surname: Uchoa-Filho fullname: Uchoa-Filho, Bartolomeu F. email: uchoa@eel.ufsc.br organization: Dept. of Electr. Eng., Fed. Univ. of Santa Catarina, Florianopolis, Brazil |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27599402$$DView record in Pascal Francis |
| BookMark | eNp9kE1LAzEQhoNUsFXvgpcF8bg1k4_dzUWQYlVQeqnnkM3O0siarUkq9t-7pdWDB0_DwPO8w7wTMvK9R0IugE4BqLpZPi2njAKfMia5FOyIjEHKMleFFCMyphSqXAlRnZBJjG_DKiSwMbld-CytMJuZtbEubbO-zV42XXLrzlmT3Cdmc-ddwnzusGuyF5OC-8pmK-M9dvGMHLemi3h-mKfkdX6_nD3mz4uHp9ndc245g5QLqcq6RI5KyIaxChqwKIBBy-uGU1WxArgQgIWAxraFYqamtUTGrZJVbfkpudrnrkP_scGY9Fu_CX44qUFQWnJWKTVQ1wfKRGu6NhhvXdTr4N5N2GpWSqUEZQNX7Dkb-hgDtnp4fXi29ykY12mgetepHjrVu071odNBpH_En-x_lMu94hDxFy8kLRRV_Bs0goD8 |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_1109_TIT_2018_2875763 crossref_primary_10_1109_TIT_2014_2346079 crossref_primary_10_1016_j_comnet_2018_03_013 crossref_primary_10_1109_TIT_2025_3536077 |
| Cites_doi | 10.1109/ISIT.2010.5513770 10.1016/0024-3795(73)90016-5 10.1017/CBO9780511804441 10.2307/2314805 10.1109/ITWKSPS.2010.5503160 10.1109/TIT.2010.2094813 10.1109/ISIT.2011.6034142 10.1109/TIT.2008.926449 10.1109/TIT.2006.881746 10.1109/TIT.2012.2236912 10.1109/ISIT.2012.6283561 10.1109/TIT.2009.2039167 |
| ContentType | Journal Article |
| Copyright | 2014 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Aug 2013 |
| Copyright_xml | – notice: 2014 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Aug 2013 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/TIT.2013.2253542 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Applied Sciences |
| EISSN | 1557-9654 |
| EndPage | 4960 |
| ExternalDocumentID | 3022411671 27599402 10_1109_TIT_2013_2253542 6506909 |
| Genre | orig-research Feature |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION AAYOK IQODW RIG 7SC 7SP 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c321t-4597b7e3e945d2281d1ce4121f3bd30982613441e641dcf692ab0b5e23c958bc3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000321928500015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9448 |
| IngestDate | Mon Jun 30 03:58:43 EDT 2025 Wed Apr 02 07:25:20 EDT 2025 Sat Nov 29 03:53:15 EST 2025 Tue Nov 18 22:25:23 EST 2025 Tue Aug 26 16:39:30 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 8 |
| Keywords | Lower bound Finite field Transfer matrix Lossless circuit Packet switching random linear network coding Channel capacity Discrete channel Subspace method finite-field matrix channel Random coding Convex programming Networked system subspace coding Memoryless channel Linear coding Linear system Network coding multiplicative matrix channel noncoherent network coding |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c321t-4597b7e3e945d2281d1ce4121f3bd30982613441e641dcf692ab0b5e23c958bc3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 1400732899 |
| PQPubID | 36024 |
| PageCount | 12 |
| ParticipantIDs | pascalfrancis_primary_27599402 crossref_citationtrail_10_1109_TIT_2013_2253542 crossref_primary_10_1109_TIT_2013_2253542 ieee_primary_6506909 proquest_journals_1400732899 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-08-01 |
| PublicationDateYYYYMMDD | 2013-08-01 |
| PublicationDate_xml | – month: 08 year: 2013 text: 2013-08-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on information theory |
| PublicationTitleAbbrev | TIT |
| PublicationYear | 2013 |
| 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 | ref13 ref12 ref14 ref11 ref1 yang (ref10) 2012; abs 1108 4257 ref19 ref18 dummit (ref20) 2004 ref7 chou (ref8) 2003 ref9 ref4 ref3 ref6 forney jr (ref17) 2003 ref5 uch a-filho (ref2) 2010; abs 1001 1021 abramson (ref16) 1963 cover (ref15) 2006 |
| References_xml | – volume: abs 1108 4257 year: 2012 ident: ref10 article-title: Capacity analysis of linear operator channels over finite fields publication-title: Comput Res Reposit – volume: abs 1001 1021 year: 2010 ident: ref2 article-title: The capacity of random linear coding networks as subspace channels publication-title: Comput Res Reposit – ident: ref9 doi: 10.1109/ISIT.2010.5513770 – year: 2003 ident: ref8 article-title: Practical network coding publication-title: 41st Annu Allerton Conf Commun Control Comput – ident: ref19 doi: 10.1016/0024-3795(73)90016-5 – ident: ref18 doi: 10.1017/CBO9780511804441 – ident: ref14 doi: 10.2307/2314805 – ident: ref11 doi: 10.1109/ITWKSPS.2010.5503160 – ident: ref6 doi: 10.1109/TIT.2010.2094813 – year: 2006 ident: ref15 publication-title: Elements of Information Theory – ident: ref1 doi: 10.1109/ISIT.2011.6034142 – ident: ref3 doi: 10.1109/TIT.2008.926449 – year: 1963 ident: ref16 publication-title: Information Theory and Coding – year: 2003 ident: ref17 article-title: On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener publication-title: 41st Annu Allerton Conf Commun Control Comput – ident: ref7 doi: 10.1109/TIT.2006.881746 – year: 2004 ident: ref20 publication-title: Abstract Algebra – ident: ref4 doi: 10.1109/TIT.2012.2236912 – ident: ref13 doi: 10.1109/ISIT.2012.6283561 – ident: ref5 doi: 10.1109/TIT.2009.2039167 – ident: ref12 doi: 10.1109/ISIT.2010.5513770 |
| SSID | ssj0014512 |
| Score | 2.1106107 |
| Snippet | This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless channel whose input and output are matrices (over a finite field)... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 4949 |
| SubjectTerms | Applied sciences Channel capacity Coding, codes Communication channels Exact sciences and technology finite-field matrix channel Information theory Information, signal and communications theory Matrix multiplicative matrix channel Network coding Network topology noncoherent network coding Optimization Probability distribution random linear network coding Receivers Signal and communications theory subspace coding Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) Transmitters Upper bound |
| Title | On the Capacity of Multiplicative Finite-Field Matrix Channels |
| URI | https://ieeexplore.ieee.org/document/6506909 https://www.proquest.com/docview/1400732899 |
| Volume | 59 |
| WOSCitedRecordID | wos000321928500015&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: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB5q8aAHq61ifZQ9eBGM3Uce3YsgYtFDq4cK3kL2ERAklb7w5zu7SYNFEbwFsglhZjfzfTuz8wFcmFzFCeMq0JHlbutGBVmuVIBkgypqMEJmuRebSMbjweurfG7AVX0Wxlrri8_stbv0uXwz1Uu3VdZHNIFkTm7BVpLE5VmtOmMQRqzsDM5wASPnWKckqexPHieuhktc49wVUcg3QpDXVHEVkdkcjZKXahY_fsw-2gxb__vOfdirUCW5LafBATRs0YbWWrGBVAu4Dbvf2g924OapIIj_yB0GTI1onExzMioLDP1O3sqS4ZvDpMHQ1bmRkWvn_0ncgYQCQ-ohvAzvJ3cPQaWnEGjB2SIIkTyoxAorw8hwjkiVaRsyznKhjKASmQYTCI9sHDKj81jyTFGFPhRaRgOlxRE0i2lhj4HEsaL5wCIf0VFoKFOZijQz1Dr1YpOYLvTXJk511WzcaV68p550UJmiU1LnlLRyShcu6yc-ykYbf4ztOKPX4yp7d6G34cX6Pk8iKZEod-Fs7da0Wqpz5D4uW-l458nvrz2FHe41MFzV3xk0F7OlPYdtvVq8zWc9Pwu_AO-p2Hw |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS-RAEC58LKgHdX3g-OyDl4WN089k-iKIOCg6o4cRvIX0IyBIRpxR_PlWdzJBcVnwFkgnhKru1Pd1VdcHcOxKk2aMm8Qqz8PWjUmK0pgEyQY11GGELMooNpENh72HB303B3_bszDe-1h85k_CZczlu7F9DVtlXUQTSOb0PCwqKTmtT2u1OQOpWN0bnOESRtYxS0pS3R1djUIVlzjB2SuU5F-CUFRVCTWRxQTNUtZ6Ft9-zTHe9Nd-9qXrsNrgSnJWT4TfMOerDVibaTaQZglvwMqnBoSbcHpbEUSA5BxDpkU8TsYlGdQlhnEv782T_mNApUk_VLqRQWjo_07CkYQKg-oW3PcvRueXSaOokFjB2TSRSB9M5oXXUjnOEasy6yXjrBTGCaqRazCBAMmnkjlbppoXhhr0orBa9YwV27BQjSu_AyRNDS17HhmJVdJRZgqjLHPUB_1il7kOdGcmzm3TbjyoXjzlkXZQnaNT8uCUvHFKB_60TzzXrTb-M3YzGL0d19i7A4dfvNje55nSGqlyB_Znbs2bxTpB9hPylYF57v77tUewdDka3OQ3V8PrPVjmUREj1ADuw8L05dUfwC_7Nn2cvBzGGfkBXBnbww |
| 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=On+the+Capacity+of+Multiplicative+Finite-Field+Matrix+Channels&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Nobrega%2C+Roberto+W.&rft.au=Silva%2C+Danilo&rft.au=Uchoa-Filho%2C+Bartolomeu+F.&rft.date=2013-08-01&rft.pub=IEEE&rft.issn=0018-9448&rft.volume=59&rft.issue=8&rft.spage=4949&rft.epage=4960&rft_id=info:doi/10.1109%2FTIT.2013.2253542&rft.externalDocID=6506909 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |