• Generalized coset codes for di...

Result: Generalized coset codes for distributed binning

Title:
Generalized coset codes for distributed binning
Authors:
PRADHAN, S. Sandeep, RAMCHANDRAN, Kannan
Source:
IEEE transactions on information theory. 51(10):3457-3474
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2005.
Publication Year:
2005
Physical Description:
print, 66 ref
Original Material:
INIST-CNRS
Subject Terms:
Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Codage, codes, Coding, codes, Algorithme, Algorithm, Algoritmo, Canal multiple, Multiple channel, Canal múltiple, Canal n, n channel, Codage canal, Channel coding, Codage source, Source coding, Décodage, Decoding, Desciframiento, Erreur quadratique moyenne, Mean square error, Error medio cuadrático, Evaluation performance, Performance evaluation, Evaluación prestación, Quantificateur, Quantifier, Cuantificador, Table codage, Codebook, Tabla codificación, Théorie groupe, Group theory, Teoría grupo, Traitement réparti, Distributed processing, Tratamiento repartido, Signal source réparti, Distributed source signal, CEO problem, Distributed source coding, multiple description source coding, random binning, trellis cosets
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109, United States
Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, Berkeley, CA 94720, United States
ISSN:
0018-9448
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17139369
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.17139369
Database:
PASCAL Archive

Further Information

In many multiterminal communication problems, constructions of good source codes involve finding distributed partitions (into bins) of a collection of quantizers associated with a group of source encoders. Further, computationally efficient procedures to index these bins are also required. In this work, we consider a constructive approach for distributed binning in an algebraic framework. Several application scenarios fall under the scope of this paper including the CEO problem, distributed source coding, and n-channel symmetric multiple description source coding with n > 2. Specifically, in this exposition we consider the case of two codebooks while focusing on the Gaussian CEO problem with mean squared error reconstruction and with two symmetric observations. This problem deals with distributed encoding of correlated noisy observations of a source into descriptions such that the joint decoder having access to them can reconstruct the source with a fidelity criterion. We employ generalized coset codes constructed in a group-theoretic setting for this approach, and analyze the performance in terms of distance properties and decoding algorithms.