Instanton method of post-error-correction analytical evaluation

Vladimir Chernyak, Misha Chertkov, Mikhail Stepanov, Bane V Vasic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

We present a theoretical tool for evaluation of the error codes' performance on graphs. The method is known under the name of instanton calculus and is common in theoretical physics. We introduce the instanton calculus for linear block codes, and give a closed form expression for the bit error rate for a class of codes whose graphical model is approximated locally by a tree.

Original languageEnglish (US)
Title of host publication2004 IEEE Information Theory Workshop - Proceedings, ITW
Pages220-224
Number of pages5
StatePublished - 2004
Event2004 IEEE Information Theory Workshop - Proceedings, ITW - San Antonio, TX, United States
Duration: Oct 24 2004Oct 29 2004

Other

Other2004 IEEE Information Theory Workshop - Proceedings, ITW
CountryUnited States
CitySan Antonio, TX
Period10/24/0410/29/04

Fingerprint

Block codes
Error correction
Bit error rate
Physics

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Chernyak, V., Chertkov, M., Stepanov, M., & Vasic, B. V. (2004). Instanton method of post-error-correction analytical evaluation. In 2004 IEEE Information Theory Workshop - Proceedings, ITW (pp. 220-224)

Instanton method of post-error-correction analytical evaluation. / Chernyak, Vladimir; Chertkov, Misha; Stepanov, Mikhail; Vasic, Bane V.

2004 IEEE Information Theory Workshop - Proceedings, ITW. 2004. p. 220-224.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chernyak, V, Chertkov, M, Stepanov, M & Vasic, BV 2004, Instanton method of post-error-correction analytical evaluation. in 2004 IEEE Information Theory Workshop - Proceedings, ITW. pp. 220-224, 2004 IEEE Information Theory Workshop - Proceedings, ITW, San Antonio, TX, United States, 10/24/04.
Chernyak V, Chertkov M, Stepanov M, Vasic BV. Instanton method of post-error-correction analytical evaluation. In 2004 IEEE Information Theory Workshop - Proceedings, ITW. 2004. p. 220-224
Chernyak, Vladimir ; Chertkov, Misha ; Stepanov, Mikhail ; Vasic, Bane V. / Instanton method of post-error-correction analytical evaluation. 2004 IEEE Information Theory Workshop - Proceedings, ITW. 2004. pp. 220-224
@inproceedings{4effed6f69fa48cabb70d4b728ac008b,
title = "Instanton method of post-error-correction analytical evaluation",
abstract = "We present a theoretical tool for evaluation of the error codes' performance on graphs. The method is known under the name of instanton calculus and is common in theoretical physics. We introduce the instanton calculus for linear block codes, and give a closed form expression for the bit error rate for a class of codes whose graphical model is approximated locally by a tree.",
author = "Vladimir Chernyak and Misha Chertkov and Mikhail Stepanov and Vasic, {Bane V}",
year = "2004",
language = "English (US)",
isbn = "0780387201",
pages = "220--224",
booktitle = "2004 IEEE Information Theory Workshop - Proceedings, ITW",

}

TY - GEN

T1 - Instanton method of post-error-correction analytical evaluation

AU - Chernyak, Vladimir

AU - Chertkov, Misha

AU - Stepanov, Mikhail

AU - Vasic, Bane V

PY - 2004

Y1 - 2004

N2 - We present a theoretical tool for evaluation of the error codes' performance on graphs. The method is known under the name of instanton calculus and is common in theoretical physics. We introduce the instanton calculus for linear block codes, and give a closed form expression for the bit error rate for a class of codes whose graphical model is approximated locally by a tree.

AB - We present a theoretical tool for evaluation of the error codes' performance on graphs. The method is known under the name of instanton calculus and is common in theoretical physics. We introduce the instanton calculus for linear block codes, and give a closed form expression for the bit error rate for a class of codes whose graphical model is approximated locally by a tree.

UR - http://www.scopus.com/inward/record.url?scp=19544370665&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=19544370665&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:19544370665

SN - 0780387201

SN - 9780780387201

SP - 220

EP - 224

BT - 2004 IEEE Information Theory Workshop - Proceedings, ITW

ER -