NDLI: Renyi to Renyi - Source Coding under Siege

Content Provider	IEEE Xplore Digital Library
Author	Baer, M.B.
Copyright Year	2006
Description	Author affiliation: Electronics for Imaging, Foster City, CA (Baer, M.B.)
Abstract	A novel lossless source coding paradigm applies to problems of unreliable lossless channels with low bit rates, in which a vital message needs to be transmitted prior to termination of communications. This paradigm can be applied to Alfred Renyi's secondhand account of an ancient siege in which a spy was sent to scout the enemy but was captured. After escaping, the spy returned to his base in no condition to speak and unable to write. His commander asked him questions that he could answer by nodding or shaking his head, and the fortress was defended with this information. Renyi told this story with reference to prefix coding, but maximizing probability of survival in the siege scenario is distinct from yet related to the traditional source coding objective of minimizing expected codeword length. Rather than finding a code minimizing expected codeword length $Xi^{n}$ $_{i=1}p(i)l(i),$ the siege problem involves maximizing $Xi^{n}$ $_{i=1}p(i)thetas^{l(i)}$ for a known thetas isin (0,1). When there are no restrictions on codewords, this problem can be solved using a known generalization of Huffman coding. The optimal solution has coding bounds which are functions of Renyi entropy; in addition to known bounds, new bounds are derived here. The alphabetically constrained version of this problem has applications in search trees and diagnostic testing. A novel dynamic programming algorithm - based upon the oldest known algorithm for the traditional alphabetic problem - optimizes this problem in O(n3 ) time and $O(n^{2})$ space, whereas two novel approximation algorithms can find a suboptimal solution faster: one in linear time, the other in O(n log n). Coding bounds for the alphabetic version of this problem are also presented
Starting Page	1258
Ending Page	1262
File Size	224716
Page Count	5
File Format	PDF
ISBN	142440505X
DOI	10.1109/ISIT.2006.262027
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-07-09
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Source coding Entropy Approximation algorithms Propagation losses Bit rate Huffman coding Dynamic programming Heuristic algorithms Cities and towns Head
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

Rényi to Rényi -- source coding under siege (2006)

Efficient algorithms for fixed-rate entropy-coded vector quantization

Renyi to Renyi -- Source Coding under Siege

D-ary Bounded-Length Huffman Coding

Alphabet Partitioning Techniques for Semiadaptive Huffman Coding of Large Alphabets

Decomposition techniques for urban consolidation problems

Reserved-length prefix coding

Rate-distortion optimal motion estimation algorithm for video coding

Rollout strategies for sequential fault diagnosis

Renyi to Renyi - Source Coding under Siege

Similar Documents

Rényi to Rényi -- source coding under siege (2006)

Efficient algorithms for fixed-rate entropy-coded vector quantization

Renyi to Renyi -- Source Coding under Siege

D-ary Bounded-Length Huffman Coding

Alphabet Partitioning Techniques for Semiadaptive Huffman Coding of Large Alphabets

Decomposition techniques for urban consolidation problems

Reserved-length prefix coding

Rate-distortion optimal motion estimation algorithm for video coding

Rollout strategies for sequential fault diagnosis

Renyi to Renyi - Source Coding under Siege