Volume 45, Number 1, January I 1999
|Page(s)||97 - 103|
|Section||Interdisciplinary physics and related areas of science and technology|
|Published online||01 September 2002|
Statistical mechanics of error-correcting codes
Department of Computational Intelligence and Systems Science, Tokyo Institute of Technology - Yokohama 226, Japan
2 The Neural Computing Research Group, Aston University, Birmingham B4 7ET, UK
Accepted: 9 October 1998
We investigate the performance of error-correcting codes, where the code word comprises products of K bits selected from the original message and decoding is carried out utilizing a connectivity tensor with C connections per index. Shannon's bound for the channel capacity is recovered for large K and zero temperature when the code rate K/C is finite. Close to optimal error-correcting capability is obtained for finite K and C. We examine the finite-temperature case to assess the use of simulated annealing for decoding and extend the analysis to accommodate other types of noisy channels.
PACS: 89.90.+n – Other areas of general interest to physicists / 89.70.+c – Information science / 05.50.+q – Lattice theory and statistics; Ising problems
© EDP Sciences, 1999
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.