Statistical Mechanics Approach to Coding Theory

被引:0
|
作者
A. Procacci
B. Scoppola
机构
[1] ICEx-UFMG,Departamento de Matematica
[2] Università “La Sapienza” di Roma,Dipartimento di Matimatica
来源
关键词
cluster expansion; coding theory;
D O I
暂无
中图分类号
学科分类号
摘要
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
页数:5
相关论文
共 50 条