q-ary graphical codes

被引：0
|
作者：
Jungnickel, Dieter
Vanstone, Scott A.
机构：
来源：
Discrete Mathematics | 1999年 / 208-209卷
关键词：
The research for this paper was done while the rst author was visiting the Department of Combinatorics and Optimization of the University of Waterloo as an Adjunct Professor. He would like to thank his colleagues there for their hospitality. The second author acknowledges the support of National Science and Engineering Research Council of Canada given under grant # 0GP0009258;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
20
引用
收藏
页码：375 / 386
相关论文
共 50 条
  • [21] LOWER BOUNDS FOR Q-ARY COVERING CODES
    CHEN, WD
    HONKALA, IS
    CHINESE SCIENCE BULLETIN, 1990, 35 (06): : 521 - 522
  • [22] Construction of Efficient q-ary Balanced Codes
    Mambou, Elie N.
    Swart, Theo G.
    2019 IEEE AFRICON, 2019,
  • [23] On new completely regular q-ary codes
    Zinoviev, V. A.
    Rifa, J.
    PROBLEMS OF INFORMATION TRANSMISSION, 2007, 43 (02) : 97 - 112
  • [24] Q-ary turbo codes with QAM modulations
    Chang, YW
    Wei, VKW
    ICUPC '96 - 1996 5TH IEEE INTERNATIONAL CONFERENCE ON UNIVERSAL PERSONAL COMMUNICATIONS RECORD, VOLS 1 AND 2, 1996, : 814 - 817
  • [25] A note on bounds for q-ary covering codes
    Bhandari, MC
    Durairajan, C
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (05) : 1640 - 1642
  • [26] A New Class of Nonlinear Q-ary Codes
    Stepanov, S.
    PROBLEMS OF INFORMATION TRANSMISSION, 2006, 42 (03) : 204 - 216
  • [27] Prefixless q-ary Balanced Codes with ECC
    Swart, Theo G.
    Immink, Kees A. S.
    2013 IEEE INFORMATION THEORY WORKSHOP (ITW), 2013,
  • [28] A new class of nonlinear Q-ary codes
    S. A. Stepanov
    Problems of Information Transmission, 2006, 42 : 204 - 216
  • [29] Binary and q-ary Tardos codes, revisited
    Skoric, Boris
    Oosterwijk, Jan-Jaap
    DESIGNS CODES AND CRYPTOGRAPHY, 2015, 74 (01) : 75 - 111
  • [30] LOWER BOUNDS FOR q-ARY COVERING CODES
    陈文德
    IIRO S. HONKALA
    ChineseScienceBulletin, 1990, (06) : 521 - 522
12345