Number of Errors that the Error-Detecting Code Surely Detects

被引：1

作者：

Ilievska, Natasa ^{[1
]}

机构：

[1] Ss Cyril & Methodius Univ, Fac Comp Sci & Engn, Skopje, North Macedonia

来源：

ICT INNOVATIONS 2017: DATA-DRIVEN INNOVATION | 2017年 / 778卷

关键词：

Linear code; Hamming distance; Generator matrix; Parity-check matrix; Error-detecting code; Linear quasigroup; Probability of undetected errors;

D O I：

10.1007/978-3-319-67597-8_21

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper we consider an error-detecting code based on linear quasigroups. We give a proof that the code is linear. Also, we obtain the generator and the parity-check matrices of the code, from where we obtain the Hamming distance of the code when a linear quasigroup of order 4 from the best class of quasigroups of order 4 for coding, i.e., the class of quasigroups of order 4 that gives smallest probability of undetected errors is used for coding. With this we determine the number of errors that the code will detect for sure.

引用

页码：219 / 228

页数：10