P. Farkaš, T. Janvars, Katarína Farkašová, E. Ruzický
{"title":"由二进制单奇偶校验积码构造的有限游程错误控制码","authors":"P. Farkaš, T. Janvars, Katarína Farkašová, E. Ruzický","doi":"10.1109/CYBERI.2018.8337547","DOIUrl":null,"url":null,"abstract":"In this paper it is shown that Run-Length Limited Error Control Codes could be constructed from two and more-dimensional Single Parity Check Product Codes in case that at least one of the component codes has even codeword length. The main advantage is that this could be done without any additional redundancy and without modification of the encoding and decoding procedure used for the underlying error control code.","PeriodicalId":6534,"journal":{"name":"2018 Cybernetics & Informatics (K&I)","volume":"51 1 1","pages":"1-4"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On run-length limited error control codes constructed from binary single parity check product codes\",\"authors\":\"P. Farkaš, T. Janvars, Katarína Farkašová, E. Ruzický\",\"doi\":\"10.1109/CYBERI.2018.8337547\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper it is shown that Run-Length Limited Error Control Codes could be constructed from two and more-dimensional Single Parity Check Product Codes in case that at least one of the component codes has even codeword length. The main advantage is that this could be done without any additional redundancy and without modification of the encoding and decoding procedure used for the underlying error control code.\",\"PeriodicalId\":6534,\"journal\":{\"name\":\"2018 Cybernetics & Informatics (K&I)\",\"volume\":\"51 1 1\",\"pages\":\"1-4\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Cybernetics & Informatics (K&I)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CYBERI.2018.8337547\",\"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 Cybernetics & Informatics (K&I)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CYBERI.2018.8337547","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On run-length limited error control codes constructed from binary single parity check product codes
In this paper it is shown that Run-Length Limited Error Control Codes could be constructed from two and more-dimensional Single Parity Check Product Codes in case that at least one of the component codes has even codeword length. The main advantage is that this could be done without any additional redundancy and without modification of the encoding and decoding procedure used for the underlying error control code.