On upper bounds for minimum distance and covering radius of non-binary codes

被引：0
|
作者：
Laihonen, Tero
Litsyn, Simon
机构：
来源：
Designs, Codes, and Cryptography | 1998年 / 14卷 / 01期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：71 / 80
相关论文
共 50 条
  • [21] COVERING RADIUS OF BINARY CODES
    HELLESETH, T
    KLOVE, T
    MYKKELTVEIT, J
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (05) : 627 - 628
  • [22] UPPER BOUNDS ON THE MINIMUM DISTANCE OF TRELLIS CODES.
    Calderbank, A.R.
    Mazo, J.E.
    Shapiro, H.M.
    The Bell System technical journal, 1983, 62 (8 pt 1): : 2617 - 2646
  • [23] Upper and Lower Bounds on the Minimum Distance of Expander Codes
    Frolov, Alexey
    Zyablov, Victor
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 1397 - 1401
  • [24] UPPER-BOUNDS ON THE MINIMUM DISTANCE OF TRELLIS CODES
    CALDERBANK, AR
    MAZO, JE
    SHAPIRO, HM
    BELL SYSTEM TECHNICAL JOURNAL, 1983, 62 (08): : 2617 - 2646
  • [25] Binary codes with covering radius one: Some new lower bounds
    Habsieger, L
    DISCRETE MATHEMATICS, 1997, 176 (1-3) : 115 - 130
  • [26] New results on codes with covering radius 1 and minimum distance 2
    Östergård, PRJ
    Quistorff, J
    Wassermann, A
    DESIGNS CODES AND CRYPTOGRAPHY, 2005, 35 (02) : 241 - 250
  • [27] Graphs associated with codes of covering radius 1 and minimum distance 2
    Hall, Joanne L.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01):
  • [28] New Results on Codes with Covering Radius 1 and Minimum Distance 2
    Patric R. J. Östergård
    Jörn Quistorff
    Alfred Wassermann
    Designs, Codes and Cryptography, 2005, 35 : 241 - 250
  • [29] Bounds on the Covering Radius of Linear Codes
    A. Ashikhmin
    A. Barg
    Designs, Codes and Cryptography, 2002, 27 : 261 - 269
  • [30] BOUNDS ON COVERING RADIUS OF LINEAR CODES
    VELIKOVA, E
    DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1988, 41 (06): : 13 - 16
12345