MAXIMUM-DISTANCE LINEAR CODES

被引：0
|
作者：
MAKI, GK
TRACEY, JH
机构：
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1971年 / 17卷 / 05期
关键词：
D O I：
10.1109/TIT.1971.1054680
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：632 / +
相关论文
共 50 条
  • [31] On the distance between linear codes
    Kwiatkowski, Mariusz
    Pankov, Mark
    [J]. FINITE FIELDS AND THEIR APPLICATIONS, 2016, 39 : 251 - 263
  • [32] On the equivalence issue of a class of 2-dimensional linear maximum rank distance codes
    Gupta, Somi
    Longobardi, Giovanni
    Trombetti, Rocco
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2023, 678 : 33 - 56
  • [33] EXPLICIT CONSTRUCTIONS OF SOME NON-GABIDULIN LINEAR MAXIMUM RANK DISTANCE CODES
    Otal, Kamil
    Ozbudak, Ferruh
    [J]. ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2016, 10 (03) : 589 - 600
  • [34] Maximum rank distance codes as space-time codes
    Lusina, P
    Gabidulin, E
    Bossert, M
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (10) : 2757 - 2760
  • [35] Unit memory convolutional codes with maximum distance
    Smarandache, R
    [J]. CODES, SYSTEMS, AND GRAPHICAL MODELS, 2001, 123 : 381 - 396
  • [36] MAXIMUM-DISTANCE-SEPARABLE CONVOLUTIONAL CODES
    JUSTESEN, J
    HUGHES, LR
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) : 288 - 288
  • [37] Maximum distance holey packings and related codes
    殷剑兴
    卢玉才
    王健敏
    [J]. Science China Mathematics, 1999, (12) : 1262 - 1269
  • [38] PSEUDOCYCLIC MAXIMUM-DISTANCE-SEPARABLE CODES
    KRISHNA, A
    SARWATE, DV
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (04) : 880 - 884
  • [39] Quantum BCH codes with maximum designed distance
    Xinmei Huang
    Qin Yue
    Xiaoping Shi
    Yiwei Huang
    [J]. Applicable Algebra in Engineering, Communication and Computing, 2022, 33 : 213 - 236
  • [40] Quantum BCH codes with maximum designed distance
    Huang, Xinmei
    Yue, Qin
    Shi, Xiaoping
    Huang, Yiwei
    [J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2022, 33 (03) : 213 - 236
12345