eprintid: 75
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/00/00/75
datestamp: 2023-11-09 15:15:42
lastmod: 2023-11-09 15:15:42
status_changed: 2023-11-09 15:12:46
type: conference_item
metadata_visibility: show
creators_name: Aziz, A.A.
creators_name: Kieffer, J.
title: Performance studies of a coding scheme for a slepian -wolf source network
ispublished: pub
keywords: Coding scheme; Computer calculation; Information sources; Linear block code; Performance study; Random sequence; Side-information; Slepian-wolf, Binary sequences; Block codes; Computer science; Encoding (symbols); Hamming distance, Channel coding
note: cited By 0; Conference of 2006 International Conference on Communications in Computing, CIC 2006 ; Conference Date: 26 June 2006 Through 29 June 2006; Conference Code:98425
abstract: We investigate the simplest Slepian-Wolf source network, consisting of an information source correlated with a second source used as a side-information for the decoder but not the encoder. The information source and side-information source are modeled as binary random sequences X=iY=Yi , respectively, for which the pairs (Xi Yi are independent- identically distributed (i.i.d). In 1973, Slepian and Wolf characterized the optimum rate at which X can be encoded so that the decoder can recover X with the aid of Y . It is only in recent years, however, that practical coding schemes have been proposed which encode at a rate close to the Slepian- Wolf rate. One such coding scheme, proposed by Ramchandran et al.2, uses a binary linear block channel code for encoding X while the decoder is furnished with the coset for each source block. We propose an alternate coding scheme, in which we also use a linear block channel code based encoder, but instead use a decoder which minimizes distortion as measure by the per-letter expected Hamming distance between source blocks and decoded source blocks. We provide the results of computer calculations indicating the distortion improvement over the Ramchandran et al.2 coding scheme that can be expected with our coding scheme. The comparisons are done for several source models and for several linear block codes. Copyright © 2006 CSREA Press.
date: 2006
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-84881601301&partnerID=40&md5=5c7d4f3a3ff6b89f6ef5a3c1d6ea3bb6
full_text_status: none
publication: Proceedings of the 2006 International Conference on Communications in Computing, CIC 2006
place_of_pub: Las Vegas, NV
pagerange: 14-20
refereed: TRUE
isbn: 1601320124; 9781601320124
citation:   Aziz, A.A. and Kieffer, J.  (2006) Performance studies of a coding scheme for a slepian -wolf source network.  In: UNSPECIFIED.