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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 64; no. 3; pp. 1232 - 1245
Main Authors: Yong Fang, Stankovic, Vladimir, Cheng, Samuel, En-hui Yang
Format: Journal Article
Language:English
Published: New York IEEE 01.03.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
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 Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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