Multilevel diversity coding with symmetrical connectivity

Roche, J.R.; Yeung, Raymond W.; Hau, Ka Pun

doi:10.1109/isit.1995.535777

Cited by 3 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…MDC was first introduced in 1992 in the thesis of Roche [6]. Early seminal papers include Yeung (1995) [7], Roche, Yeung, and Hau (1995) [8], [9], and Yeung and Zhang (1999) [2]. The connection between MDC and the multiple descriptions problem is explored in [7], Fu and Yeung (2002) [10], as well as in the more recent work of Mohajer, Tian and Diggavi (2008) [11], [12].…”

Section: B Multilevel Diversity Coding (Mdc)mentioning

confidence: 99%

Rate region for a class of delay mitigating codes and P2P networks

Weber

Walsh

2012

2012 46th Annual Conference on Information Sciences and Systems (CISS)

View full text Add to dashboard Cite

This paper identifies the relevance of a distributed source coding problem first formulated by Yeung and Zhang in 1999 to two applications in network design: i) the design of delay mitigating codes, and ii) the design of network coded P2P networks. When transmitting time-sensitive frames from a source to a destination over a multipath network using a collection of coded packets, the decoding requirements determine which subsets of packets will be sufficient for decoding which frames. The rate region of packet sizes consistent with these requirements is shown to be an instance of the aforementioned distributed source coding problem. When encoding file chunks into packets in a peer to peer system, the peers wish to receive their chunks as soon as possible while uploading data at as low a rate as possible. It is shown that the region of encoded packet sizes consistent with the decoding constraints is another instance of the aforementioned distributed source coding problem. These rate regions are placed in the larger context of rate-delay tradeoffs in designing delay mitigating codes and efficient P2P systems.

show abstract

Section: B Multilevel Diversity Coding (Mdc)mentioning

confidence: 99%

Rate region for a class of delay mitigating codes and P2P networks

Weber

Walsh

2012

2012 46th Annual Conference on Information Sciences and Systems (CISS)

View full text Add to dashboard Cite

show abstract

“…Here, we confine our discussion to multilevel diversity coding systems with symmetrical connectivity between the encoders and decoders, referred to as symmetrical multilevel diversity coding (SMDC) [3]- [5]. The SMDC system finds applications in distributed data storage [6], [7], secret sharing This paper was presented in part at 2018 IEEE International Symposium on Information Theory (ISIT) [1].…”

Section: Introductionmentioning

confidence: 99%

The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding

Guo

Yeung

2018

2018 Information Theory and Applications Workshop (ITA)

View full text Add to dashboard Cite

It is well known that superposition coding, namely separately encoding the independent sources, is optimal for symmetric multilevel diversity coding (SMDC) (Yeung-Zhang 1999) for any L ≥ 2, where L is the number of levels of the coding system. However, the characterization of the coding rate region therein involves uncountably many linear inequalities and the constant term (i.e., the lower bound) in each inequality is given in terms of the solution of a linear optimization problem. Thus this implicit characterization of the coding rate region does not enable the determination of the achievability of a given rate tuple. In principle, the achievability of a given rate tuple can be determined by direct computation, but the complexity is prohibitive even for L = 5. In this paper, for any fixed L, we obtain in closed form a finite set of linear inequalities for characterizing the coding rate region. We further show by the symmetry of the problem that only a much smaller subset of this finite set of inequalities needs to be verified in determining the achievability of a given rate tuple. Yet, the cardinality of this smaller set grows at least exponentially fast with L. We also present a subset entropy inequality, which together with our explicit characterization of the coding rate region, is sufficient for proving the optimality of superposition coding.

show abstract

The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding

Guo

Yeung

2020

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Multilevel diversity coding with symmetrical connectivity

Cited by 3 publications

References 2 publications

Rate region for a class of delay mitigating codes and P2P networks

Rate region for a class of delay mitigating codes and P2P networks

The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding

The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding

Contact Info

Product

Resources

About