On the Maximal Achievable Rate for Signal-Code Construction Based on Interleaved Reed-Solomon Codes for Multiple Access System Over Vector-Disjunctive Channel
{"title":"On the Maximal Achievable Rate for Signal-Code Construction Based on Interleaved Reed-Solomon Codes for Multiple Access System Over Vector-Disjunctive Channel","authors":"F. Ivanov, P. Rybin","doi":"10.1109/BlackSeaCom.2018.8433716","DOIUrl":null,"url":null,"abstract":"We consider a signal-code construction for a special class of multiple access system over vector-disjunctive channel. This construction is based on interleaved Reed-Solomon codes with collaborative decoding. The considered methods of encoding and decoding on one hand have acceptable complexity for a wide range parameters and on other one a decoding algorithm is able to correct significantly more collisions than bounded-distance decoder. We estimate a maximum achievable relative sum-rate of this construction for fixed number of active users and total number of frequencies to transmit.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BlackSeaCom.2018.8433716","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We consider a signal-code construction for a special class of multiple access system over vector-disjunctive channel. This construction is based on interleaved Reed-Solomon codes with collaborative decoding. The considered methods of encoding and decoding on one hand have acceptable complexity for a wide range parameters and on other one a decoding algorithm is able to correct significantly more collisions than bounded-distance decoder. We estimate a maximum achievable relative sum-rate of this construction for fixed number of active users and total number of frequencies to transmit.