A. Kuznetsov and B. Tsybakov, "Coding in a memory with defective cells," Problems of Information Transmission, vol. 10, no. 2, pp. 132-- 138, 1974.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....t e = t and t d = n (Encoder knows all positions where errors may occur, while Decoder is ignorant) corresponds to data transmission over a channel with localized errors. The coding problem for this channel was formulated in [1] as a generalization of the problem for memories with defective cells [2] and it was intensively studied in recent years [3] 4] 5] 6] for q = 2: The case t e t and t d = n was also considered [4] and called data transmission over a channel with partially localized errors. A basic idea developed in the analysis of the situation when Encoder has side information ....

A.V.Kuznetsov and B.S.Tsybakov, "Coding in a memory with defective cells," Problemy Peredachi Informatsii, vol.10, no.2, pp.52-60, Apr.-June 1974. English translation : Probl.Inform.Transmission, vol.10, pp.132-138, 1974.

....t e = t and t d = n (Encoder knows all positions where errors may occur, while Decoder is ignorant) corresponds to data transmission over a channel with localized errors. The coding problem for this channel was formulated in [1] as a generalization of the problem for memories with defective cells [2] and it was intensively studied last years [3] 4] 5] 6] for q = 2: The case t e t and t d = n was also considered [4] and called data transmission over a channel with partially localized errors. A basic idea developed in the analysis of the situation when Encoder has side information is a ....

A.V.Kuznetsov and B.S.Tsybakov, "Coding in a memory with defective cells," Problemy Peredachi Informatsii, vol.10, no.2, pp.52-60, Apr.-June 1974. English translation : Probl.Inform.Transmission, pp.132-138.

....localized erasures if for different messages these subsets are disjoint (then the encoding mapping is invertible) Precise definitions are given in the next section. Two transmission problems studied previously are close to our problem. The first is called codes for channels with (memory) defects [8]. Under this model, codewords are stored in memory with some cells stuck at either 0 or 1. Therefore, no matter what is written in these bits by the sender, the receiver always reads a fixed value. The second model deals with codes correcting localized errors [4] The definition is the same as ....

....codes with distance t ffn is nH 2 (ff) On the contrary, the minimum redundancy of a code of length n that corrects t localized erasures is t (see Proposition 2.1) Our results show that this bound is essentially tight. The same lower bound is valid (and is tight) for codes correcting defects [8]. For localized errors the upper and lower bounds on the number of checks have order nH 2 (ff) 4] As remarked above, for larger alphabets there exist MDS codes that correct t usual erasures with t check symbols. The encoding decoding time is of order O(tn) for RS codes and O(n) for codes of Alon ....

A.V. Kuznetsov and B. S. Tsybakov, "Coding for memory with defective cells," Problemy Peredachi Informatsii, 10 (2) (1974), 52--60 (in Russian) and 132--138 (English translation).

.... Write Unidirectional Memory, Coding, Decoding The work was supported by the SFB 343, Universitat Bielefeld, Germany 1 Introduction and Statement of the Problem The study of different models of the memory from the point of view of information theory was initiated by Kuznetsov and Tsybakov [1], who introduced coding problems for the memory with defective cells (some cells always output fixed bits regardless of information that was stored) Rivest and Shamir [2] Wolf, Wyner, Ziv, and Korner [3] and the other authors analyzed a model that was called Write Once Memory WOM : if x t 2 ....

A.V.Kuznetsov and B.S.Tsybakov, "Coding in a memory with defective cells," Problemy Peredachi Informatsii, vol.10, no.2, pp.52-60, Apr.-June 1974. English translation : Probl.Inform.Transmission, pp.132-138.

....throughput of global networks operating in datagram transmission mode, mentioned in [7] were addressed in Albanese et al. 4] Asmuth and Blakley [15] Kabatianski and Krouk [92] McAuley [120] Rabin [132] 2.2.2. Codes for memories with defective cells were introduced by Kuznetsov and Tsybakov [104]. In the same paper they proved Theorem 2.22. Theorems 2.23 and 2.24 are from Dumer [52] 2.2.3. Studying codes correcting localized errors was suggested by Bassalygo, Gelfand, and Pinsker [25] A problem complementary to correcting erasures is decoding given the set of error values, i.e. finding ....

A.V. Kuznetsov and B. S. Tsybakov, "Coding for memory with defective cells," Problems of Info. Trans., 10 (2) (1974), 52--60 and 132--138.

No context found.

A. Kuznetsov and B. Tsybakov, "Coding in a memory with defective cells," Problems of Information Transmission, vol. 10, no. 2, pp. 132-- 138, 1974.

No context found.

A.V.Kuznetsov and B.S.Tsybakov, "Coding in a memory with defective cells," Problemy Peredachi Informatsii, vol.10, no.2, pp.52-60, Apr.-June 1974. English translation : Probl.Inform.Transmission, pp.132-138.

No context found.

A.V. Kuznetsov, B.S. Tsybakov, "Coding in a memory with defective cells", Problems of Information Transmission, Vol. 10, No. 2, 132--138, 1974.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC