Codes for a generalized wire-tap channel model (Q2355660)

From the authors' introduction: In [\textit{L. H. Ozarow} and \textit{A. D. Wyner}, AT\&T Bell Lab. Tech. J. 63, 2135--2157 (1984; Zbl 0587.94013)] there was considered a wire-tap model in a noiseless channel where an adversary (eavesdropper) can tap arbitrary \(t\) out of \(n\) transmitted symbols. The goal of legal users is to choose a coding method under which the adversary obtains as little as possible information on the encoded message from the tapped data. To solve this problem, in the paper cited above a random coding method using cosets of linear codes was proposed. In Section 2 of the present paper we give a brief description of this method and an analysis of its security presented in [\textit{V. K. Wei}, IEEE Trans. Inf. Theory 37, No. 5, 1412--1418 (1991; Zbl 0735.94008)]. In Section 3 we consider a natural generalization of the wire-tap model where a legal user receives data from a noisy channel and an adversary knows not only \(t\) code symbols but also \(m\) information symbols. Such a model occurs, for example, in distributed data storage systems.