Statistical mechanics of error-correcting codes

Abstract

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.

Publication DOI: https://doi.org/10.1209/epl/i1999-00137-2
Divisions: College of Engineering & Physical Sciences > Systems analytics research institute (SARI)
Aston University (General)
Additional Information: Copyright of EDP Sciences
Uncontrolled Keywords: performance,error-correcting codes,message,decoding,connectivity tensor,temperature,noisy channels
Publication ISSN: 1286-4854
Last Modified: 01 Nov 2024 08:04
Date Deposited: 29 Jul 2009 09:51
Full Text Link:
Related URLs: http://www.scop ... tnerID=8YFLogxK (Scopus URL)
http://iopscien ... ect=.iopscience (Publisher URL)
PURE Output Type: Article
Published Date: 1999-01-01
Authors: Kabashima, Yoshiyuki
Saad, David (ORCID Profile 0000-0001-9821-2623)

Download

[img]

Version: Published Version


Export / Share Citation


Statistics

Additional statistics for this record