| E. Ayanoglu, C.-L. I, R. D. Gitlin, and J. E. Mazo, "Diversity coding: using error control for self-healing in communication networks," Proceeditzgs of IEEE INFOCOM '90, Vol. 1, pp. 95 104, San Francisco, California, June 1990. |
....be denoted as B e , i.e. B e = # i : # i is identified with # e # ,e , # e,e ## or # e,# for any e # , e ## and # . Network recovery under non ergodic failures has until now generally been considered in terms of routing, except for a very special case of coding for network recovery presented in [8]. For any particular link failure pattern f we define B(f) as B(f) e:fe =1 B e The following lemma makes the connection between the network problem without and with a link failure pattern f : M[ #] be the system matrix of a linear network coding problem and let f be a particular link ....
E. Ayanoglu, C.-L. I, R.D. Gitlin and J. E. Mazo, "Diversity Coding: Using Error Control for Self-healing in Communication Networks", INFOCOM '90, Ninth Annual Joint Conference of the IEEE Computer and Communication Societies, vol.1 pp. 95-104, 1990
....error free when they are operational. Links, however, are allowed to fail altogether. Indeed, coding is not only applicable to networks in order to achieve capacity, but can also be used to recover from network failures. For an early work pointing into this direction we refer to Ayanoglu et al. [14] where coding strategies for simple networks are suggested. Such failures are di erent from link errors, described by ergodic processes, which would be typically dealt by using channel coding. The failures we consider entail the permanent removal of an edge, such as would occur in a network if ....
E. Ayanoglu, I. Chih-Lin, R.D. Gitlin, and J.D. Mazo, \Diversity coding: using error control for self-healing in communication networks" Proceedings INFOCOM '90, Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration. Proceedings, pp.95-104 vol.1, 1990
....These applications also fall into the category of erasure channel coding. 2 Diversity Coding We assume that the reader is familiar with the theory of finite fields. For more information on this subject we refer the reader to one of the standard texts on the subject such as [11] or [12] or to [13] for a summary. In Section 2.1 we present a minimum set of information on linear coding theory to introduce notation and nomenclature, and to enable the reader to follow the discussion in the rest of the section. Then, using this background, we describe two methods of diversity coding for failure ....
....1 r 3 [12, p. 321] Bk,k2 . k, z,z2 . z, is not a Vandermonde matrix in general. Therefore, it cannot be verified nonsingular with the method we used for Bk,k2 . k, However, if the field GF(2 TM) is chosen large enough, then Bk,k2 . k, z,z2 . z, must be nonsingular. In [13], we proved that if 3 1 m max degdetBk,k2 . k, z,z2 . 3 I i) N i) 18) k ,k2 , k ;l ,12 , l i=1 then der B q, z,z . z, 7 0 (19) for 1 ] 1 ] 2 ] z N, 1 ll 12 lz ]k , and one can always recover the data in the case of a ....
[Article contains additional citation context not shown here]
E. Ayanoglu, C.-L. I, R. D. Gitlin, and J. E. Mazo, "Diversity coding: using error control for self-healing in communication networks," Proceeditzgs of IEEE INFOCOM '90, Vol. 1, pp. 95 104, San Francisco, California, June 1990.
No context found.
E. Ayanoglu, C. I, R. D. Gitlin and J. E. Mazo, `Diversity coding: Using error control for self healing in communication networks', Proceedings of INFOCOM'90, San Francisco, California, June 1990, 95-104.
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