Rank deficient decoding of linear network coding

Since all packets in linear network coding are subject to linear combinations, in all existing network coding schemes, a full rank of received packets is required to start decoding. This requirement unfortunately results in long delays and low throughputs. In this work we propose two classes of rank...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing (1998) pp. 5080 - 5084
Main Authors: Zhiyuan Yan, Hongmei Xie, Suter, Bruce W.
Format: Conference Proceeding
Language:English
Published: IEEE 01.05.2013
Subjects:
Decoding
Delays
Hamming weight
Linear network coding
Linear programming
Network coding
rank deficient decoding
Throughput
Vectors
ISSN:1520-6149
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Since all packets in linear network coding are subject to linear combinations, in all existing network coding schemes, a full rank of received packets is required to start decoding. This requirement unfortunately results in long delays and low throughputs. In this work we propose two classes of rank deficient decoders that work for rank deficient received packets. Within either class, different decoding strategies have been proposed for tradeoffs between delay/throughput and data accuracy. The decoders of the first class take advantage of the sparsity inherent in data and produce the data vectors with the smallest Hamming weight. Since these decoders have high complexities, we propose a class of decoders with polynomial complexities based on linear programming. Both classes of decoders can recover data from fewer received packets and hence achieve higher throughputs and shorter delays than the full rank decoder.
AbstractList Since all packets in linear network coding are subject to linear combinations, in all existing network coding schemes, a full rank of received packets is required to start decoding. This requirement unfortunately results in long delays and low throughputs. In this work we propose two classes of rank deficient decoders that work for rank deficient received packets. Within either class, different decoding strategies have been proposed for tradeoffs between delay/throughput and data accuracy. The decoders of the first class take advantage of the sparsity inherent in data and produce the data vectors with the smallest Hamming weight. Since these decoders have high complexities, we propose a class of decoders with polynomial complexities based on linear programming. Both classes of decoders can recover data from fewer received packets and hence achieve higher throughputs and shorter delays than the full rank decoder.
Author Suter, Bruce W.
Hongmei Xie
Zhiyuan Yan
Author_xml – sequence: 1
  surname: Zhiyuan Yan
  fullname: Zhiyuan Yan
  organization: Dept. of Electr. & Comput. Eng., Lehigh Univ., Bethlehem, PA, USA
– sequence: 2
  surname: Hongmei Xie
  fullname: Hongmei Xie
  organization: Dept. of Electr. & Comput. Eng., Lehigh Univ., Bethlehem, PA, USA
– sequence: 3
  givenname: Bruce W.
  surname: Suter
  fullname: Suter, Bruce W.
  organization: Air Force Res. Lab., Rome, NY, USA
BookMark eNotj9tKAzEURSNUsFP9gr7MD8x4cjtJHqV4g4Ji2-eSTE4ktmZkZkD8ewvt096wYLN2xWalL8TYkkPLObj719XDZvPeCuCyRZQWhbtiFVfGOZAaccbmXAtokCt3w6px_AIAa5SdM_jw5VBHSrnLVKZT6_qYy2fdp_qYC_mhLjT99sOhPoNbdp38caS7Sy7Y7ulxu3pp1m_PJ491k7nRU5OM5CBDEEEJn7SLBkVMnieioNB2IiWhSKND0iRSkBaUjqTAgwsqklyw5Xk3E9H-Z8jffvjbX97Jf3NeRfI
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/ICASSP.2013.6638629
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 1479903566
9781479903566
EndPage 5084
ExternalDocumentID 6638629
Genre orig-research
GroupedDBID 23M
29P
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-i175t-f73103bb2b42af59d762dfa1feeb468c2ff24e5696e5e2fb38045de40a09b4de3
IEDL.DBID RIE
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000329611505047&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1520-6149
IngestDate Wed Aug 27 04:48:04 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-f73103bb2b42af59d762dfa1feeb468c2ff24e5696e5e2fb38045de40a09b4de3
PageCount 5
ParticipantIDs ieee_primary_6638629
PublicationCentury 2000
PublicationDate 2013-May
PublicationDateYYYYMMDD 2013-05-01
PublicationDate_xml – month: 05
  year: 2013
  text: 2013-May
PublicationDecade 2010
PublicationTitle Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing (1998)
PublicationTitleAbbrev ICASSP
PublicationYear 2013
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0008748
Score 1.9138367
Snippet Since all packets in linear network coding are subject to linear combinations, in all existing network coding schemes, a full rank of received packets is...
SourceID ieee
SourceType Publisher
StartPage 5080
SubjectTerms Decoding
Delays
Hamming weight
Linear network coding
Linear programming
Network coding
rank deficient decoding
Throughput
Vectors
Title Rank deficient decoding of linear network coding
URI https://ieeexplore.ieee.org/document/6638629
WOSCitedRecordID wos000329611505047&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
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB7a4kEvPlrxzR48uu12s9kkRykWBSnFqvRWNskEirArtfX3O8kuVcGLtyEJQ0JgvplkZj6Aayms4znTcUHhT5w5pkhiLtZcM_IWuLaBG_D1UUwmcj5X0xbcbGthEDEkn2Hfi-Ev31Zm45_KBoSO5ICrNrSFyOtara3VlSIwZREc-XAoU02HoWGiBg-j29ls6tO4WL9R8YtLJUDJeP9_mziA3ndNXjTdos0htLA8gr0f7QS7kDwV5Vtk0TeFIB0kmcovjioXeW-yWEVlnfUd1RM9eBnfPY_u44YRIV4SzK9jJzwtmNapztLCcWXJlFlXDB2iznJpUufSDHmucuSYOs0keWwWs6RIlM4ssmPolFWJJxBxZRSipNjYUIwlNMF2YWwicWhyMjzuFLr-7Iv3uunFojn22d_D57CbBp4Inwl4AZ31aoOXsGM-18uP1VW4qS9av5Ll
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED_mFNQXPzbx2zz4aLeuadrmUYZjwzmGm7K30SQXGEIrc_Pv99KWqeCLb0cSjoTA_e6Su_sB3CaxsSLiyksp_PFCyyVJ3HpKKE7eglCm4AZ8HcajUTKbyXEN7ja1MIhYJJ9hy4nFX77J9do9lbUJHckBl1uw7ZizRFmttbG7SVxwZREguYAolFWPoY4v24Pu_WQydolcvFUp-cWmUoBJ7-B_2ziE5ndVHhtv8OYIapgdw_6PhoIN8J_T7I0ZdG0hSAdJOneLWW6Z8yfTJcvKvG9WTjThpfcw7fa9ihPBWxDQrzwbO2IwpQIVBqkV0pAxMzbtWEQVRokOrA1CFJGMUGBgFU_IZzMY-qkvVWiQn0A9yzM8BSaklogJRceaoqxYEXCn2vgJdnREpseeQcOdff5etr2YV8c-_3v4Bnb706fhfDgYPV7AXlCwRri8wEuor5ZrvIId_blafCyvi1v7AjmkljA
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=proceeding&rft.title=Proceedings+of+the+...+IEEE+International+Conference+on+Acoustics%2C+Speech+and+Signal+Processing+%281998%29&rft.atitle=Rank+deficient+decoding+of+linear+network+coding&rft.au=Zhiyuan+Yan&rft.au=Hongmei+Xie&rft.au=Suter%2C+Bruce+W.&rft.date=2013-05-01&rft.pub=IEEE&rft.issn=1520-6149&rft.spage=5080&rft.epage=5084&rft_id=info:doi/10.1109%2FICASSP.2013.6638629&rft.externalDocID=6638629
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1520-6149&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1520-6149&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1520-6149&client=summon