scispace - formally typeset
Search or ask a question

Showing papers by "Jack K. Wolf published in 1963"


Journal ArticleDOI
TL;DR: A new coding technique is proposed lying midway between error-detection and error-correction coding that permits the location of digit errors to within a sub-block of the received message block without, in general, permitting the precise determination of erroneous digit positions.
Abstract: A new coding technique is proposed lying midway between error-detection and error-correction coding. The block of received digits is regarded as subdivided into mutually exclusive sub-blocks. Errors occurring within particular sub-blocks are detected at the receiver and, in addition, the receiver is able to determine, by using the code redundancy, which particular sub-blocks contain errors. Such {\em error-locating} codes permit the location of digit errors to within a sub-block of the received message block without, in general, permitting the precise determination of erroneous digit positions. Two families of such codes are described, both of them limited to locating a single erroneous sub-block. One family permits the detection of up to t-1 errors in any one sub-block of length t . The second family locates up to two errors per sub-block, but is generally more efficient in its use of redundancy than the first family. Upper and lower bounds are given for the number of check digits required with any error-locating code. Codes meeting the lower bound exactly are termed {\em optimum} error-locating codes. All the codes of the second family, as well as some isolated examples of t-1 error-locating codes are optimum in this sense. The amount of redundancy required for such codes does not appear excessive and error location may provide an attractive alternative to conventional error detection in decision feedback communications.

83 citations


Journal ArticleDOI
TL;DR: The effects of filtering a random binary sequence with certain finite memory linear and nonlinear filters are considered and the statistical properties of the filtered sequence such as the power spectral density and amplitude distribution function are examined.
Abstract: The effects of filtering a random binary sequence with certain finite memory linear and nonlinear filters are considered. Of interest are the statistical properties of the filtered sequence such as the power spectral density and amplitude distribution function, as well as methods for recovering the original sequence. Applications of these techniques to communication systems are discussed.

7 citations