×

Unidirectional error detecting codes. (English) Zbl 0941.94519

Cohen, G. (ed.) et al., EUROCODE ’90. International Symposium on Coding Theory and Applications, Udine, Italy, November 5-9, 1990. Proceedings. Berlin etc.: Springer-Verlag. Lect. Notes Comput. Sci. 514, 94-105 (1991).
Summary: A fixed-length binary code is called \(t\)-unidirectional error detecting if no codeword can be transformed into another codeword by at most \(t\) unidirectional errors. In this paper we consider the problem of mapping information sequences of length \(k\) into code-words of a \(t\)-unidirectional error detecting code of length \(k+p\). In case of systematic codes we show that the parameters \(p\) and \(t\) must satisfy the relation \(t\leq 2^p-2^{p/2+1}+p\). Moreover, we give a simple systematic encoding to map information sequences into codewords of a \(t\)-unidirectional error detecting code. In case of nonsystematic codes, we give a method to design \(t\)-unidirectional error detecting codes in which the number \(p\) of check bits must satisfy the inequality \(t\leq 2^p-p-1\). The encoding and decoding algorithms require time linear in the number \(k\) of information bits.
For the entire collection see [Zbl 0755.94003].

MSC:

94B60 Other types of codes
PDFBibTeX XMLCite