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 条
  • [1] Quasi-perfect codes with small distance
    Etzion, T
    Mounits, B
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 453 - 453
  • [2] Quasi-perfect Lee distance codes
    AlBdaiwi, BF
    Bose, B
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (06) : 1535 - 1539
  • [3] Fast decoding of quasi-perfect Lee distance codes
    Horak, Peter
    AlBdaiwi, Bader F.
    DESIGNS CODES AND CRYPTOGRAPHY, 2006, 40 (03) : 357 - 367
  • [4] Quasi-perfect linear codes with minimum distance 4
    Giulietti, Massimo
    Pasticci, Fabio
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (05) : 1928 - 1935
  • [5] Fast decoding of quasi-perfect Lee distance codes
    Peter Horak
    Bader F. AlBdaiwi
    Designs, Codes and Cryptography, 2006, 40 : 357 - 367
  • [6] Weight Spectrum of Quasi-Perfect Binary Codes with Distance 4
    Afanassiev, Valentin B.
    Davydov, Alexander A.
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 2193 - 2197
  • [7] Quasi-perfect codes in the lp metric
    Strapasson, Joao E.
    Jorge, Grasiele C.
    Campello, Antonio
    Costa, Sueli I. R.
    COMPUTATIONAL & APPLIED MATHEMATICS, 2018, 37 (02): : 852 - 866
  • [8] Quasi-perfect Lee distance codes in Z2K
    AlMohammad, BFA
    Bose, B
    ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 486 - 486
  • [9] Binary and ternary linear quasi-perfect codes with small dimensions
    Baicheva, Tsonka
    Bouyukliev, Iliya
    Dodunekov, Stefan
    Fack, Veerle
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (09) : 4335 - 4339
  • [10] SOME ADDITIONAL QUASI-PERFECT CODES
    WAGNER, TJ
    INFORMATION AND CONTROL, 1967, 10 (03): : 334 - &
12345