Code design casing deterministic annealing

Joseph, Binoy and Makur, Anamitra (1996) Code design casing deterministic annealing. In: Sadhana : Academy Proceedings in Engineering Sciences, 21 (part 1). pp. 91-99.

Preview

PDF Code_design_using.pdf - Published Version Download (481kB)

Abstract

We address the problem of designing codes for specific applications using deterministic annealing. Designing a block code over any finite dimensional space may be thought of as forming the corresponding number of clusters over the particular dimensional space. We have shown that the total distortion incurred in encoding a training set is related to the probability of correct reception over a symmetric channel. While conventional deterministic annealing make use of the Euclidean squared error distance measure, we have developed an algorithm that can be used for clustering with Hamming distance as the distance measure, which is required in the error correcting, scenario.

Item Type:	Journal Article
Publication:	Sadhana : Academy Proceedings in Engineering Sciences
Publisher:	Indian academy of sciences
Additional Information:	Copyright of this article belongs to Indian academy of sciences.
Keywords:	Error correcting code;Hamming distance;deterministic annealing
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	21 Apr 2011 06:14
Last Modified:	21 Apr 2011 06:14
URI:	http://eprints.iisc.ac.in/id/eprint/37074

Actions (login required)

View Item