DISCUS

From Wikipedia, the free encyclopedia

The introduction to this article provides insufficient context for those unfamiliar with the subject matter.
Please help improve the introduction to meet Wikipedia's layout standards. You can discuss the issue on the talk page.

DISCUS is an acronym for Distributed Source Coding Using Syndromes.

Contents

DISCUS is a compression algorithm used to compress correlated data sources.

DISCUS is a particular scheme used in source coding which is designed to achieve the Slepian-Wolf bound (David Slepian) by using channel codes.

DISCUS was invented by researchers SS Pradhan and K Ramachandran, in their seminal paper Distributed source coding using syndromes (DISCUS): design and construction published in the Information Theory, IEEE Transactions on, 2003.

DISCUS is a source coding scheme for correlated sources, which are common in the case of sensor readings from a dense group of wireless sensor networks. DISCUS tries to model a particular source correlation as a channel noise, and tries to find a channel code that performs well for this channel noise. This channel code, is then proved to be the best code that can perform as a source code for the correlated data sources.

Many variations of DISCUS are presented in related literature. One such popular scheme is the Channel Code Partitioning scheme, which is an a-priori scheme, to reach the Slepian-Wolf bound. Many papers illustrate simulations and experiments on channel code partitioning using the turbo codes, Hamming codes and Irregular Repeat Accumulate Codes.

  • Modulo-N code is a simpler technique for compressing correlated data sources.


Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../d/i/s/DISCUS_0d42.html"
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.