{"title":"A precoding scheme with generation crossing for network coding","authors":"D. Hu, M. Wang, F. Lau, Q. Peng","doi":"10.1109/APCC.2009.5375492","DOIUrl":null,"url":null,"abstract":"Random network coding based on the generation concept provides various benefits such as reduced system complexity. However, various generation updating processes used in general result in a throughput loss. In this paper, we propose a network coding scheme using a concept we call “generation crossing”. We also introduce a full cardinality precode, which enables the receiver to recover the lost packets when only a subset of the linearly independent encoded packets is received at the destination. We show that the successful delivery probability of all generations increases remarkably with a small number of overlapped packets between successive generations.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 15th Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2009.5375492","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Random network coding based on the generation concept provides various benefits such as reduced system complexity. However, various generation updating processes used in general result in a throughput loss. In this paper, we propose a network coding scheme using a concept we call “generation crossing”. We also introduce a full cardinality precode, which enables the receiver to recover the lost packets when only a subset of the linearly independent encoded packets is received at the destination. We show that the successful delivery probability of all generations increases remarkably with a small number of overlapped packets between successive generations.