NDLI: Linear complexity universal decoding with exponential error probability decay

Content Provider	IEEE Xplore Digital Library
Author	Coleman, T.P. Medard, M. Effros, M.
Copyright Year	2005
Description	Author affiliation: Caltech, Pasadena, CA, USA (Coleman, T.P.; Medard, M.; Effros, M.)
Abstract	In this manuscript we consider linear complexity binary linear block encoders and decoders that operate universally with exponential error probability decay. Such scenarios may be relevant in wireless scenarios where probability distributions may not be fully characterized due to the dynamic nature of wireless environments. More specifically, we consider the setting of fixed length-to-fixed length near-lossless data compression of a memoryless binary source of unknown probability distribution as well as the dual setting of communicating on a binary symmetric channel (BSC) with unknown crossover probability. We introduce a new 'min-max distance' metric, analogous to minimum distance, that addresses the universal binary setting and has the same properties as that of minimum distance on BSCs with known crossover probability. The code construction and decoding algorithm are universal extensions of the 'expander codes' framework of Barg and Zemor and have identical complexity and exponential error probability performance.
Starting Page	1593
Ending Page	1596
File Size	719934
Page Count	4
File Format	PDF
ISBN	0780393058
DOI	10.1109/WIRLES.2005.1549651
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-06-13
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Linear code Wireless sensor networks Dictionaries Error probability Memory management Data compression Probability distribution Graph theory Decoding Channel coding
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

Linear Complexity Universal Decoding with Exponential Error Probability Decay

Linear Complexity Universal Decoding with Exponential Error Probability Decay

Polynomial complexity universal block decoding with exponential error probability decay (2006).

Towards practical minimum-entropy universal decoding

Secure data provenance compression using arithmetic coding in wireless sensor networks

Iterative joint source channel decoding in wireless sensor networks

Secure data aggregation and source-channel coding with MIT code for wireless sensor networks

Multiple-Input Turbo Code for Joint Data Aggregation, Source and Channel Coding in Wireless Sensor Networks

Progressive Coding and Iterative Source-Channel Decoding in Wireless Data Gathering Networks

Linear complexity universal decoding with exponential error probability decay

Similar Documents

Linear Complexity Universal Decoding with Exponential Error Probability Decay

Linear Complexity Universal Decoding with Exponential Error Probability Decay

Polynomial complexity universal block decoding with exponential error probability decay (2006).

Towards practical minimum-entropy universal decoding

Secure data provenance compression using arithmetic coding in wireless sensor networks

Iterative joint source channel decoding in wireless sensor networks

Secure data aggregation and source-channel coding with MIT code for wireless sensor networks

Multiple-Input Turbo Code for Joint Data Aggregation, Source and Channel Coding in Wireless Sensor Networks

Progressive Coding and Iterative Source-Channel Decoding in Wireless Data Gathering Networks

Linear complexity universal decoding with exponential error probability decay