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 条
  • [1] An upper bound for the number of uniformly packed codes
    Tokareva, Natalia
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 346 - 349
  • [2] Upper bound on the number of inequivalent extended binary irreducible Goppa codes
    Huang, Daitao
    Yue, Qin
    DISCRETE MATHEMATICS, 2024, 347 (01)
  • [3] UNIFORMLY PACKED CODES
    GOETHALS, JM
    VANTILBORG, HCA
    PHILIPS RESEARCH REPORTS, 1975, 30 (01): : 9 - 36
  • [4] An upper bound for binary constant weight codes
    Fu, FW
    Shen, SY
    JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 2001, 94 (02) : 197 - 203
  • [5] On a lower bound on the number of perfect binary codes
    Malyugin, SA
    DISCRETE APPLIED MATHEMATICS, 2004, 135 (1-3) : 157 - 160
  • [6] UNIFORMLY PACKED CODES.
    Bassalygo, L.A.
    Zaitsev, G.V.
    Zinov'ev, V.A.
    Problems of Information Transmission (English translation of Problemy Peredachi Informatsii), 1974, 10 (01): : 6 - 9
  • [7] An upper bound of the number of distinct powers in binary words
    Li, Shuo
    DISCRETE MATHEMATICS, 2024, 347 (04)
  • [8] A new upper bound on the rate of non-binary codes
    Ben-Haim, Yael
    Litsyn, Simon
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 297 - 301
  • [9] Upper Bound on List-Decoding Radius of Binary Codes
    Polyanskiy, Yury
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (03) : 1119 - 1128
  • [10] Upper bound on list-decoding radius of binary codes
    Polyanskiy, Yury
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2231 - 2235
12345