{"title":"论检错码的检错特性","authors":"Natasha Ilievska","doi":"10.1109/TELFOR.2018.8612087","DOIUrl":null,"url":null,"abstract":"In this paper we consider an error-detecting code. The code is defined using linear quasigroups. In the focus of the paper is the number of errors that the code surely detects. Using simulations, we obtain this number in the case when linear quasigroups of order 4 that give smallest probability of undetected errors are used for coding.","PeriodicalId":229131,"journal":{"name":"2018 26th Telecommunications Forum (TELFOR)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the Error-Detection Properties of the Error-Detecting Code\",\"authors\":\"Natasha Ilievska\",\"doi\":\"10.1109/TELFOR.2018.8612087\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider an error-detecting code. The code is defined using linear quasigroups. In the focus of the paper is the number of errors that the code surely detects. Using simulations, we obtain this number in the case when linear quasigroups of order 4 that give smallest probability of undetected errors are used for coding.\",\"PeriodicalId\":229131,\"journal\":{\"name\":\"2018 26th Telecommunications Forum (TELFOR)\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 26th Telecommunications Forum (TELFOR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TELFOR.2018.8612087\",\"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 26th Telecommunications Forum (TELFOR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TELFOR.2018.8612087","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Error-Detection Properties of the Error-Detecting Code
In this paper we consider an error-detecting code. The code is defined using linear quasigroups. In the focus of the paper is the number of errors that the code surely detects. Using simulations, we obtain this number in the case when linear quasigroups of order 4 that give smallest probability of undetected errors are used for coding.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
