On deterministic linear network coded broadcast and its relation to matroid theory

Deterministic linear network coding (DLNC) is an important family of network coding techniques for wireless packet broadcast. In this paper, we show that DLNC is strongly related to and can be effectively studied using matroid theory without bridging index coding. We prove the equivalence between th...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2014 IEEE Information Theory Workshop (ITW 2014) s. 536 - 540
Hlavní autori: Mingchao Yu, Sadeghi, Parastoo, Aboutorab, Neda
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.11.2014
Predmet:
Decoding
Encoding
Graphics
Indexes
matroid representability
Network coding
Receivers
throughput
wireless broadcast
Wireless communication
ISSN:1662-9019
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Deterministic linear network coding (DLNC) is an important family of network coding techniques for wireless packet broadcast. In this paper, we show that DLNC is strongly related to and can be effectively studied using matroid theory without bridging index coding. We prove the equivalence between the DLNC solution and matrix matroid. We use this equivalence to study the performance limits of DLNC in terms of the number of transmissions and its dependence on the finite field size. Specifically, we derive the sufficient and necessary condition for the existence of perfect DLNC solutions and prove that such solutions may not exist over certain finite fields. We then show that identifying perfect solutions over any finite field is still an open problem in general. To fill this gap, we develop a heuristic algorithm which employs graphic matroids to find perfect DLNC solutions over any finite field. Numerical results show that its performance in terms of minimum number of transmissions is close to the lower bound, and is better than random linear network coding when the field size is not so large.
AbstractList Deterministic linear network coding (DLNC) is an important family of network coding techniques for wireless packet broadcast. In this paper, we show that DLNC is strongly related to and can be effectively studied using matroid theory without bridging index coding. We prove the equivalence between the DLNC solution and matrix matroid. We use this equivalence to study the performance limits of DLNC in terms of the number of transmissions and its dependence on the finite field size. Specifically, we derive the sufficient and necessary condition for the existence of perfect DLNC solutions and prove that such solutions may not exist over certain finite fields. We then show that identifying perfect solutions over any finite field is still an open problem in general. To fill this gap, we develop a heuristic algorithm which employs graphic matroids to find perfect DLNC solutions over any finite field. Numerical results show that its performance in terms of minimum number of transmissions is close to the lower bound, and is better than random linear network coding when the field size is not so large.
Author Mingchao Yu
Aboutorab, Neda
Sadeghi, Parastoo
Author_xml – sequence: 1
  surname: Mingchao Yu
  fullname: Mingchao Yu
  email: ming.yu@anu.edu.au
  organization: Res. Sch. of Eng., Australian Nat. Univ., Canberra, ACT, Australia
– sequence: 2
  givenname: Parastoo
  surname: Sadeghi
  fullname: Sadeghi, Parastoo
  email: parastoo.sadeghi@anu.edu.au
  organization: Res. Sch. of Eng., Australian Nat. Univ., Canberra, ACT, Australia
– sequence: 3
  givenname: Neda
  surname: Aboutorab
  fullname: Aboutorab, Neda
  email: neda.aboutorab@anu.edu.au
  organization: Res. Sch. of Eng., Australian Nat. Univ., Canberra, ACT, Australia
BookMark eNot0MFKAzEQgOEIFay1d8FLXmDrZLPZ7BylqC0UClLwWCabCQbbRLIB6dt7sKf_9h3-ezFLObEQjwpWSgE-bw-fqxZUt-rRwjDgjViiHVRnEQ0iwkzMVd-3DYLCO7GcpuigNdp0qHAuPvZJeq5czjHFqcZRnmJiKjJx_c3lW47Zs5euZPIjTVVS8jLWSRY-UY05yZrlmWrJ0cv6xblcHsRtoNPEy2sX4vD2elhvmt3-fbt-2TURoTY6dIO1hqzj0LE3nkdr0TmAoSM3jhB0wN5Qq4KGITjgngMZ0tb1xjvSC_H0z0ZmPv6UeKZyOV4n6D9TSVRQ
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ITW.2014.6970889
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781479959990
1479959995
EndPage 540
ExternalDocumentID 6970889
Genre orig-research
GroupedDBID 6IE
6IF
6IL
AAJGR
ALMA_UNASSIGNED_HOLDINGS
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i90t-3f48775a7bef4ed5dec779bb0084abcc0f3f965a21f308fb0e6efa5a37b65dba3
IEDL.DBID RIE
ISSN 1662-9019
IngestDate Wed Aug 27 04:53:41 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-3f48775a7bef4ed5dec779bb0084abcc0f3f965a21f308fb0e6efa5a37b65dba3
PageCount 5
ParticipantIDs ieee_primary_6970889
PublicationCentury 2000
PublicationDate 2014-Nov.
PublicationDateYYYYMMDD 2014-11-01
PublicationDate_xml – month: 11
  year: 2014
  text: 2014-Nov.
PublicationDecade 2010
PublicationTitle 2014 IEEE Information Theory Workshop (ITW 2014)
PublicationTitleAbbrev ITW
PublicationYear 2014
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssib025354919
ssib037136480
ssib023431652
ssib027547604
Score 1.963478
Snippet Deterministic linear network coding (DLNC) is an important family of network coding techniques for wireless packet broadcast. In this paper, we show that DLNC...
SourceID ieee
SourceType Publisher
StartPage 536
SubjectTerms Decoding
Encoding
Graphics
Indexes
matroid representability
Network coding
Receivers
throughput
wireless broadcast
Wireless communication
Title On deterministic linear network coded broadcast and its relation to matroid theory
URI https://ieeexplore.ieee.org/document/6970889
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LSgMxFA1tceFKpRXfZOHSaad5TtZi0U0tUrC7kscNzMIZmU4F_95JZloV3LgL2STcBO7rnHMRujWZNyrLTGIt1wkjAIlW3CfE0Ca-JkDApHHYhJzPs9VKLXrobs-FAYAIPoNxWMZevivtNpTKJkLJgMrpo76UouVq7f4OoYHTzfeumnDaZD7fUmVEciZ_6JDQJjkTLA5WmwpBAkpB7bqYqZo8LV8D7IuNuyN_zV6Jrmd29L9LH6PRN4cPL_be6QT1oBiil-cCuw4AExWacYgydYWLFg2OA8PdYVOV2lm9qbEuHM7rDa46zByuS_wWyue5w5ED-TlCy9nD8v4x6aYqJLlK64T6JkWRXEsDnoHjDqyUypggrK-NtamnXgmuydTTtHnIFAR4zTWVRnBnND1Fg6Is4Axh5ihPvZS2iQlZwHR65oR2mRDMcknJORoGc6zfW92MdWeJi7-3L9FhsHjL87tCg7rawjU6sB91vqlu4mN_Ae4ipv8
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LSgMxFA21CrpSacW3Wbh02mmek7UoLdZaZMDuSp7QhTMynQr-vZPMtFVw4y5kk3ATuK9zzgXgViVOiSRRkdZURgRZG0lBXYQUruJrZJFVcRg2wSeTZDYT0xa423BhrLUBfGZ7fhl6-SbXK18q6zPBPSpnB-xSQlBcs7XWvwdhz-qmG2eNKK5yn61YGeKU8B9KJLhKzxgJo9UGjCGPUxDrPmYs-qP0zQO_SK859Nf0leB8Hg__d-0j0N2y-OB045-OQctmHfD6kkHTQGCCRjP0caYsYFbjwaHnuBuoilwaLZcllJmBi3IJiwY1B8scvvsC-sLAwIL86oL08SG9H0bNXIVoIeIywq5KUjiVXFlHrKHGas6FUl5aXyqtY4edYFSigcNx9ZSxZdZJKjFXjBol8QloZ3lmTwEkBtPYca6rqJB4VKcjhkmTMEY05RidgY43x_yjVs6YN5Y4_3v7BuwP0-fxfDyaPF2AA2_9mvV3CdplsbJXYE9_lotlcR0e_hvRbKpG
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%3Abook&rft.genre=proceeding&rft.title=2014+IEEE+Information+Theory+Workshop+%28ITW+2014%29&rft.atitle=On+deterministic+linear+network+coded+broadcast+and+its+relation+to+matroid+theory&rft.au=Mingchao+Yu&rft.au=Sadeghi%2C+Parastoo&rft.au=Aboutorab%2C+Neda&rft.date=2014-11-01&rft.pub=IEEE&rft.issn=1662-9019&rft.spage=536&rft.epage=540&rft_id=info:doi/10.1109%2FITW.2014.6970889&rft.externalDocID=6970889
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1662-9019&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1662-9019&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1662-9019&client=summon