Code design using deterministic annealing |
| |
Authors: | Binoy Joseph Anamitra Makur |
| |
Affiliation: | (1) Department of Electrical Communication Engineering, Indian Institute of Science, 560 012 Bangalore, India |
| |
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. |
| |
Keywords: | Error correcting code Hamming distance deterministic annealing |
本文献已被 SpringerLink 等数据库收录! |