Quasi-perfect codes with small distance

被引：15
|
作者：
Etzion, T [1 ]
Mounits, B
机构：
[1] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
[2] Technion Israel Inst Technol, Dept Math, IL-32000 Haifa, Israel
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2005年 / 51卷 / 11期
关键词：
blockwise direct sum (BDS) construction; covering; density; packing; quasi-perfect codes;
D O I：
10.1109/TIT.2005.856944
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The main purpose of this paper is to give bounds on the length of the shortest and longest binary quasi-perfect codes with a given Hamming distance, covering radius, and redundancy. We consider codes with Hamming distance 4 and. 5 and covering radius 2 and 3, respectively. We discuss the blockwise direct sum (BDS) construction which has an important role in finding these bounds.
引用
收藏
页码：3938 / 3946
页数：9
相关论文
共 50 条
  • [21] Quasi-perfect linear codes from planar and APN functions
    Li, Chunlei
    Helleseth, Tor
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2016, 8 (02): : 215 - 227
  • [22] ON QUASI-PERFECT RINGS
    CAMILLO, VP
    XUE, WM
    COMMUNICATIONS IN ALGEBRA, 1991, 19 (10) : 2841 - 2850
  • [23] QUASI-PERFECT MODULES
    GOLAN, JS
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1969, 16 (07): : 1077 - &
  • [24] Quasi-perfect hashing
    Czech, ZJ
    COMPUTER JOURNAL, 1998, 41 (06): : 416 - 421
  • [25] Perfect and quasi-perfect lattice actions
    Bietenholz, W
    THEORY OF ELEMENTARY PARTICLES, 1998, : 466 - 482
  • [26] Quasi-Perfect Lee Codes of Radius 2 and Arbitrarily Large Dimension
    Camarero, Cristobal
    Martinez, Carmen
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (03) : 1183 - 1192
  • [27] Using the Package "Coding Theory" for a Search Technique for Quasi-Perfect Codes
    Gashkov, Igor
    INTERNATIONAL ELECTRONIC CONFERENCE ON COMPUTER SCIENCE, 2008, 1060 : 133 - 136
  • [28] A family of constacyclic ternary quasi-perfect codes with covering radius 3
    Danev, Danyo
    Dodunekov, Stefan
    Radkova, Diana
    DESIGNS CODES AND CRYPTOGRAPHY, 2011, 59 (1-3) : 111 - 118
  • [29] On decoding binary quasi-perfect codes over Markov noise channels
    Al-Lawati, Haider
    Alajaji, Fady
    2007 10TH CANADIAN WORKSHOP ON INFORMATION THEORY, 2007, : 164 - 167
  • [30] A family of constacyclic ternary quasi-perfect codes with covering radius 3
    Danyo Danev
    Stefan Dodunekov
    Diana Radkova
    Designs, Codes and Cryptography, 2011, 59 : 111 - 118
12345