scispace - formally typeset
Search or ask a question

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


Journal ArticleDOI
TL;DR: The criterion for optimality is that the normalized average of the squared norm of the difference between the T - second undistorted source sample and the corresponding T -second sample delivered to the final destination be minimum.
Abstract: This paper is concerned with the transmission of information with a fidelity criterion where the source output may be distorted prior to encoding and, furthermore, where the output of the decoder may be distorted prior to its delivery to the final destination. The criterion for optimality is that the normalized average of the squared norm of the difference between the T - second undistorted source sample and the corresponding T -second sample delivered to the final destination be minimum. The optimal structure of the encoder and decoder is derived for any T .

235 citations


Journal ArticleDOI
TL;DR: The concept of burst distance is introduced and subsequently develops burst-correcting properties of a code relative to its burst distance, which strengthen the single-burst correcting (SBC) properties of some codes.
Abstract: This paper is concerned with burst error, burst erasure and combined burst-error and burst-erasure correction. Part I introduces the concept of burst distance and subsequently develops burst-correcting properties of a code relative to its burst distance. Part II discusses product codes for multiple-burst correction (MBC). The MBC properties of a product of two codes are derived from the properties of the original codes. The correction of spot errors is generalized to multiple-spot correction. Theorems are presented which strengthen the single-burst correcting (SBC) properties of some codes. A class of codes which corrects single, triple and quadruple bursts and 5 single errors is developed, and a decoding procedure is given. Finally, a code from the new class of MBC codes is compared with three other MBC codes.

27 citations


Journal ArticleDOI
Jack K. Wolf1, A.D. Wyner1, Jacob Ziv1
TL;DR: A positive coding theorem and a converse is proved for this channel and a deterministic code (Reed-Solomon code) and bounded discrepancy decoding is proved.
Abstract: A mathematical model is proposed for a postal service which occasionally loses letters. A positive coding theorem and a converse is proved for this channel. The coding theorem is proved by utilizing a deterministic code (Reed-Solomon code) and bounded discrepancy decoding.

10 citations