{"title":"Construction and decoding of OSMLD codes derived from unital and oval designs","authors":"Otmane El Mouaatamid, M. Lahmer, M. Belkasmi","doi":"10.1109/COMMNET.2018.8360280","DOIUrl":null,"url":null,"abstract":"A construction of One-Step Majority-Logic Decodable (OSMLD) codes based on the incidence matrices of Balanced Incomplete Block Designs (BIBD) is given. In this paper, we focus on unital and oval designs which are constructed from a Projective Geometry (PG). Thus, we derive from the unital and oval designs new systematic and non-systematic OSMLD codes with rates and lengths not available with existing OSMLD codes. Simulation results show that the derived codes converge well under Iterative Threshold Decoding with an efficient trade-off between complexity and performances.","PeriodicalId":103830,"journal":{"name":"2018 International Conference on Advanced Communication Technologies and Networking (CommNet)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Advanced Communication Technologies and Networking (CommNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMMNET.2018.8360280","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
A construction of One-Step Majority-Logic Decodable (OSMLD) codes based on the incidence matrices of Balanced Incomplete Block Designs (BIBD) is given. In this paper, we focus on unital and oval designs which are constructed from a Projective Geometry (PG). Thus, we derive from the unital and oval designs new systematic and non-systematic OSMLD codes with rates and lengths not available with existing OSMLD codes. Simulation results show that the derived codes converge well under Iterative Threshold Decoding with an efficient trade-off between complexity and performances.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
