Closed-Form Approximation of Maximum Free Distance for Binary Block Codes
Closed-Form Approximation of Maximum Free Distance for Binary Block Codes
复制标题
二进制分组码最大自由距离的闭式逼近
DOI：
10.1109/vetecf.2009.5378953
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
L. Hanzo
中科院分区：
文献类型：
--
作者：
J. Akhtman;R. Maunder;N. Bonello;L. Hanzo
We devise an analytically simple as well as invertible approximate expression, which describes the relation between the maximum free distance of a binary code and the corresponding maximum attainable code-rate. For example, for a half-rate, length-128 binary code the known bounds limit the maximum attainable free distance to $16<d(n=128,r=0.5)<32$, while our solution yields $d(n=128,r=0.5)\approx 22$. The results provided may be utilized for the design and characterization of efficient coding schemes.
