Hamming Distance Spectrum of DAC Codes for Equiprobable Binary Sources

Distributed arithmetic coding (DAC) is an effective technique for implementing Slepian-Wolf coding (SWC). It has been shown that a DAC code partitions source space into unequal-size codebooks, so that the overall performance of DAC codes depends on the cardinality and structure of these codebooks. T...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications Jg. 64; H. 3; S. 1232 - 1245
Hauptverfasser: Yong Fang, Stankovic, Vladimir, Cheng, Samuel, En-hui Yang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.03.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
codebook cardinality spectrum
Complexity theory
Decoding
distributed arithmetic coding
Distributed source coding
Electronic mail
Encoding
Hamming distance
Hamming distance spectrum
Random variables
Slepian-Wolf coding
Yttrium
distributed arithmetic coding
codebook cardinality spectrum
Hamming distance spectrum
Distributed source coding
Slepian–Wolf coding
ISSN:0090-6778, 1558-0857
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Distributed arithmetic coding (DAC) is an effective technique for implementing Slepian-Wolf coding (SWC). It has been shown that a DAC code partitions source space into unequal-size codebooks, so that the overall performance of DAC codes depends on the cardinality and structure of these codebooks. The problem of DAC codebook cardinality has been solved by the so-called codebook cardinality spectrum (CCS). This paper extends the previous work on CCS by studying the problem of DAC codebook structure. We define Hamming distance spectrum (HDS) to describe DAC codebook structure and propose a mathematical method to calculate the HDS of DAC codes. The theoretical analyses are verified by experimental results.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2016.2518680