{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
