基于单形和椭圆形设计的OSMLD码的构造和解码

2018 International Conference on Advanced Communication Technologies and Networking (CommNet) Pub Date : 2018-04-02 DOI:10.1109/COMMNET.2018.8360280

Otmane El Mouaatamid, M. Lahmer, M. Belkasmi

{"title":"基于单形和椭圆形设计的OSMLD码的构造和解码","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":"{\"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}","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

摘要

给出了一种基于平衡不完全块设计(BIBD)关联矩阵的一步多数逻辑可译码结构。本文主要讨论由射影几何(PG)构造的单位和椭圆设计。因此，我们从单一和椭圆形设计中得到新的系统和非系统OSMLD代码，其速率和长度是现有OSMLD代码无法获得的。仿真结果表明，该算法在迭代阈值译码下具有较好的收敛性，在复杂度和性能之间取得了很好的平衡。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Construction and decoding of OSMLD codes derived from unital and oval designs

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 International Conference on Advanced Communication Technologies and Networking (CommNet)

自引率

0.00%

发文量