An upper bound for the number of uniformly packed binary codes

被引：0
|
作者：
Tokareva N.N. [1 ]
机构：
[1] Sobolev Institute of Mathematics, Novosibirsk 630090
来源：
Journal of Applied and Industrial Mathematics | 2008年 / 2卷 / 3期
基金：
俄罗斯基础研究基金会;
关键词：
Minimum Distance; Binary Vector; Binary Code; Wide Sense; Pack Binary;
D O I：
10.1134/S1990478908030137
中图分类号：
学科分类号：
摘要：
Under study are the binary codes uniformly packed (in the wide sense) of length n with minimum distance d and covering radius ρ. It is shown that every code of this kind is uniquely determined by the set of its codewords of weights [n/2]-ρ..., [n/2] + ρ. For odd d, the number of distinct codes is at most 22n-d/2log2n+o(log2n). © MAIK Nauka 2008.
引用
收藏
页码：426 / 431
页数：5
相关论文
共 50 条
12345