S. S. Pradhan and K. Ramchandran, \Group theoretic construction and analysis of generalized coset codes for asymmetric-symmetric distributed source coding," in Proc. Conf. on Inf. Sciences and Systems, March 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Effect of Organization on Energy Consumption in Wireless .. - Duarte-Melo, Liu (Correct)
....each other. This approach is mentioned and used for comparison in [3] It does not require any communication between sensors and therefore results in very little overhead. However, the gain from data compression or data fusion, while still possible theoretically (see for example symmetric encoding [8]) will be a ected. In addition, sensors further away from the receiver will inevitably die sooner than the ones that are closer to the receiver. This problem becomes more severe as the size of the eld becomes large comparing to the distance between the eld and the receiver. Moreover, as the ....
S. S. Pradhan and K. Ramchandran, \Group theoretic construction and analysis of generalized coset codes for asymmetric-symmetric distributed source coding," in Proc. Conf. on Inf. Sciences and Systems, March 2000.
Distributed source coding: Symmetric rates and.. - Pradhan, Ramchandran (2000) (16 citations) Self-citation (Pradhan Ramchandran) (Correct)
....[11, 10] a group theoretic formulation of generalized coset codes was presented and it was shown that trellis codes and lattice codes are special cases of generalized coset codes. A formulation of generalized coset codes for distributed source coding and their distance properties are analyzed in [12]. In this section we give results for the special case of trellises and lattices. 3.2 Trellis codes for encoding 3.2.1 Construction of sub codes As an illustrative framework, we consider with no loss of generality, trellis codes based on a scalar quantizer (extensions to other cases are ....
....and y 2 must be at least d c . We have the following theorem which guarantees that d c is at least half the minimum distance (d min ) of C. Theorem: For trellis codes, using the partition of the generator polynomial matrix as given above, d c dmin 2 . Proof: Omitted due to lack of space. see [12]) 3.3 Lattice codes for encoding A lattice [8] in an N dimensional Euclidean space is a discrete additive sub group [15] of R N . An N dimensional lattice will have N basis vectors w 1 ; w 2 ; wN such that = N X i=1 i w i j i is an integer for i = 1; 2; N ) In ....
[Article contains additional citation context not shown here]
S. S. Pradhan and K. Ramchandran, "Group-theoretic construction and analysis of generalized coset codes for symmetric/asymmetric distributed source coding," preprint, Jan 2000.
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