DISCUS
Encyclopedia
For the American trade association that has the same acronym, see Distilled Spirits Council of the United States
Distilled Spirits Council of the United States
The Distilled Spirits Council of the United States is a national trade association representing producers and marketers of distilled spirits sold in the United States...



DISCUS is an acronym for Distributed source coding
Distributed source coding
Distributed source coding is an important problem in information theory and communication. DSC problems regard the compression of multiple correlated information sources that do not communicate with each other...

 Using Syndromes
.

Introduction

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

DISCUS is a particular scheme used in source coding
Source coding
In information theory, Shannon's source coding theorem establishes the limits to possible data compression, and the operational meaning of the Shannon entropy....

 which is designed to
achieve the Slepian-Wolf bound (David Slepian
David Slepian
David S. Slepian was an American mathematician.Born in Pittsburgh, Pennsylvania he studied B.Sc. at University of Michigan before joining the forces in World War II,as Sonic deception officer in the Ghost army....

) by using channel codes.

History

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.

Variations

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 code
Hamming code
In telecommunication, Hamming codes are a family of linear error-correcting codes that generalize the Hamming-code invented by Richard Hamming in 1950. Hamming codes can detect up to two and correct up to one bit errors. By contrast, the simple parity code cannot correct errors, and can detect only...

s and Irregular Repeat Accumulate Codes.

See also

  • Modulo-N code
    Modulo-N code
    Modulo-N code is a lossy compression algorithm used to compress correlated data sources using modulo arithmetic.-Compression:When applied to two nodes in a network whose data are in close range of each other Modulo-N code...

     is a simpler technique for compressing correlated data sources.

  • Distributed source coding
    Distributed source coding
    Distributed source coding is an important problem in information theory and communication. DSC problems regard the compression of multiple correlated information sources that do not communicate with each other...


External links

The source of this article is wikipedia, the free encyclopedia.  The text of this article is licensed under the GFDL.
 
x
OK