NDLI: String matching-based universal source codes for source networks with asymptotically zero feedback

Content Provider	IEEE Xplore Digital Library
Author	En-hui Yang Da-ke He Uyematsu, T. Yeung, R.W.
Copyright Year	2005
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont. (En-hui Yang; Da-ke He)
Abstract	Consider a source network in which a finite alphabet source X = {X $_{i}\}^{i}$ $_{infin=0}$ is to be encoded and transmitted, and another finite alphabet source Y = $\{Y_{i}\}^{i}$ $_{infin=0}$ available only to the decoder as the side information correlated with X. Traditionally the channel between the encoder and decoder in the source network is assumed to be one-way. This, together with that the encoder does not have access to Y, necessitates that the encoder knows the achievable rates before encoding. In this paper we consider universal source coding for a feedback source network in which the channel between the encoder and decoder is two-way and asymmetric. Assuming that the encoder and decoder share a random database that is independent of both X and Y, we propose a string matching-based (variable-rate) block coding algorithm with a simple progressive encoder for the feedback source network. This algorithm does not need to know the achievable rates at the beginning of encoding. It is proven that for any (X, Y) in a large class of sources which includes the class of all memoryless sources, the class of all aperiodic Markov sources, and a large class of finite-state sources as special subclasses, the average number of bits per letter transmitted from the encoder to the decoder (compression rate) goes arbitrarily close to the conditional entropy H(X\|Y) of X given Y asymptotically, and the average number of bits per letter transmitted from the decoder to the encoder (feedback rate) goes to 0 asymptotically
Starting Page	2349
Ending Page	2353
File Size	159741
Page Count	5
File Format	PDF
ISBN	0780391519
DOI	10.1109/ISIT.2005.1523768
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-09-04
Publisher Place	Australia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Feedback Decoding Helium Entropy Communication systems Error probability Source coding Databases Block codes Councils
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Universal Multiterminal Source Coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case

Universal Data Compression with Side Information at the Decoder by Using Traditional Universal Lossless Compression Algorithms

The error exponent with delay for lossless source coding

Universal Fixed-Length Coding Redundancy

Upper Bound on Error Exponents with Delay for Lossless Source Coding with Side-Information

Redundancy of Variable Rate Slepian-Wolf Codes from the Decoder's Perspective

On the Redundancy-Error Tradeoff in Slepian-Wolf Coding and Channel Coding

On error exponents, coding and feedback for decoding delay constrained communication systems

On Universal Variable-Rate Slepian-Wolf Coding

String matching-based universal source codes for source networks with asymptotically zero feedback

Similar Documents

Universal Multiterminal Source Coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case

Universal Data Compression with Side Information at the Decoder by Using Traditional Universal Lossless Compression Algorithms

The error exponent with delay for lossless source coding

Universal Fixed-Length Coding Redundancy

Upper Bound on Error Exponents with Delay for Lossless Source Coding with Side-Information

Redundancy of Variable Rate Slepian-Wolf Codes from the Decoder's Perspective

On the Redundancy-Error Tradeoff in Slepian-Wolf Coding and Channel Coding

On error exponents, coding and feedback for decoding delay constrained communication systems

On Universal Variable-Rate Slepian-Wolf Coding

String matching-based universal source codes for source networks with asymptotically zero feedback