{"title":"Signature codes for a special class of multiple access channel","authors":"E. Egorova, V. Potapova","doi":"10.1109/RED.2016.7779325","DOIUrl":null,"url":null,"abstract":"A specific noiseless multiple-access channel model is studied in this paper. Proofs for lower and upper bounds on the achievable-rate of corresponding codes are given.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RED.2016.7779325","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
A specific noiseless multiple-access channel model is studied in this paper. Proofs for lower and upper bounds on the achievable-rate of corresponding codes are given.