Presentation	2007-01-30 Construction of a Lossy Source Code Using LDPC Matrices Shigeki MIYAKE, Jun MURAMATSU,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Research into applying LDPC code theory, which is used for channel coding, to source coding has received a lot of attention in several research fields such as Distributed Source Coding. In this paper a source coding problem with a fidelity criterion is considered. Matsunaga et al. [3] constructed a lossy code under the conditions of a binary alphabet, a uniform distribution, and a Hamming measure of fidelity criterion. We extend their results and construct a lossy code under the extended conditions of a binary alphabet, a distribution which is not necessarily uniform, and a fidelity measure which is bounded and additive and show that the code can achieve the optimal rate, rate-distortion function.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	lossy source code / LDPC matrix / rate-distortion function
Paper #	IT2006-51
Date of Issue

Conference Information
Committee	IT
Conference Date	2007/1/23(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Information Theory (IT)
Language	ENG
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Construction of a Lossy Source Code Using LDPC Matrices
Sub Title (in English)
Keyword(1)	lossy source code
Keyword(2)	LDPC matrix
Keyword(3)	rate-distortion function
1st Author's Name	Shigeki MIYAKE
1st Author's Affiliation	NTT Network Innovation Laboratories()
2nd Author's Name	Jun MURAMATSU
2nd Author's Affiliation	NTT Communication Science Laboratories
Date	2007-01-30
Paper #	IT2006-51
Volume (vol)	vol.106
Number (no)	516
Page	pp.pp.-
#Pages	5
Date of Issue