符号对读信道上代码的伊莱亚斯型上界

2020 International Symposium on Computer Engineering and Intelligent Communications (ISCEIC) Pub Date : 2020-08-01 DOI:10.1109/ISCEIC51027.2020.00053

Jie Yan, Xiaofeng Xu, Chengmin Wang

{"title":"符号对读信道上代码的伊莱亚斯型上界","authors":"Jie Yan, Xiaofeng Xu, Chengmin Wang","doi":"10.1109/ISCEIC51027.2020.00053","DOIUrl":null,"url":null,"abstract":"Motivated by the application of high-density data storage technologies, symbol-pair read channels are proposed in which every two consecutive symbols are read together. A lot of work has been done on this coding model. Bounds of codes play an important role in coding theory, which act as criterions to measure the optimality of a code. Several bounds have been developed for symbol-pair codes, among of which the Singleton type bound is most popular one. In this paper, we continue the research of bounds and establish the Elias type upper bound for binary symbol-pair codes.","PeriodicalId":249521,"journal":{"name":"2020 International Symposium on Computer Engineering and Intelligent Communications (ISCEIC)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The Elias Type Upper Bound of Codes over Symbol-pair Read Channels\",\"authors\":\"Jie Yan, Xiaofeng Xu, Chengmin Wang\",\"doi\":\"10.1109/ISCEIC51027.2020.00053\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Motivated by the application of high-density data storage technologies, symbol-pair read channels are proposed in which every two consecutive symbols are read together. A lot of work has been done on this coding model. Bounds of codes play an important role in coding theory, which act as criterions to measure the optimality of a code. Several bounds have been developed for symbol-pair codes, among of which the Singleton type bound is most popular one. In this paper, we continue the research of bounds and establish the Elias type upper bound for binary symbol-pair codes.\",\"PeriodicalId\":249521,\"journal\":{\"name\":\"2020 International Symposium on Computer Engineering and Intelligent Communications (ISCEIC)\",\"volume\":\"87 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Symposium on Computer Engineering and Intelligent Communications (ISCEIC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCEIC51027.2020.00053\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Symposium on Computer Engineering and Intelligent Communications (ISCEIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCEIC51027.2020.00053","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在高密度数据存储技术应用的激励下，提出了符号对读取通道，将每两个连续的符号一起读取。在这个编码模型上已经做了很多工作。码界在编码理论中占有重要地位，它是衡量码的最优性的标准。对于符号对码，已经发展了几种边界，其中最流行的是单例类型边界。本文继续研究了二进制符号对码的界，建立了二进制符号对码的Elias型上界。

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

查看原文本刊更多论文

The Elias Type Upper Bound of Codes over Symbol-pair Read Channels

Motivated by the application of high-density data storage technologies, symbol-pair read channels are proposed in which every two consecutive symbols are read together. A lot of work has been done on this coding model. Bounds of codes play an important role in coding theory, which act as criterions to measure the optimality of a code. Several bounds have been developed for symbol-pair codes, among of which the Singleton type bound is most popular one. In this paper, we continue the research of bounds and establish the Elias type upper bound for binary symbol-pair codes.

求助全文

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

来源期刊

2020 International Symposium on Computer Engineering and Intelligent Communications (ISCEIC)

自引率

0.00%

发文量