Statistical mechanics approach to coding theory

被引:9
|
作者
Procacci, A [1 ]
Scoppola, B
机构
[1] UFMG, ICEx, Dept Matemat, Belo Horizonte, MG, Brazil
[2] Univ Rome La Sapienza, Dipartimento Matimat, I-00185 Rome, Italy
关键词
cluster expansion; coding theory;
D O I
10.1023/A:1004666811087
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We propose a method based on cluster expansion to study the optimal code with a given distance between codewords. Using this approach we find the Gilbert-Varshamov lower bound for the rate of largest code.
引用
收藏
页码:907 / 912
页数:6
相关论文
共 50 条