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 条
  • [1] DECODING OF MAXIMUM-DISTANCE SEPARABLE LINEAR CODES
    YAU, SS
    LIU, YC
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1971, 17 (04) : 487 - +
  • [2] On the Threshold of Maximum-Distance Separable Codes
    Kindarji, Bruno
    Cohen, Gerard
    Chabanne, Herve
    [J]. 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 1163 - 1167
  • [3] Arbitrary rate maximum-distance separable wavelet codes
    Fekri, F
    [J]. 2002 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-IV, PROCEEDINGS, 2002, : 2253 - 2256
  • [4] On extended Kaczmarz methods with random sampling and maximum-distance for solving large inconsistent linear systems
    Lv, Zhonglu
    Bao, Wendi
    Li, Weiguo
    Wang, Fang
    Wu, Guoli
    [J]. RESULTS IN APPLIED MATHEMATICS, 2022, 13
  • [5] A NEW FAMILY OF LINEAR MAXIMUM RANK DISTANCE CODES
    Sheekey, John
    [J]. ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2016, 10 (03) : 475 - 488
  • [6] Linear Maximum Rank Distance Codes of Exceptional Type
    Bartoli, Daniele
    Zini, Giovanni
    Zullo, Ferdinando
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (06) : 3627 - 3636
  • [7] Non-linear maximum rank distance codes
    Antonio Cossidente
    Giuseppe Marino
    Francesco Pavese
    [J]. Designs, Codes and Cryptography, 2016, 79 : 597 - 609
  • [8] Non-linear maximum rank distance codes
    Cossidente, Antonio
    Marino, Giuseppe
    Pavese, Francesco
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2016, 79 (03) : 597 - 609
  • [9] MAXIMUM DISTANCE BOUNDS FOR LINEAR ANTI-CODES
    HASHIM, AA
    [J]. PROCEEDINGS OF THE INSTITUTION OF ELECTRICAL ENGINEERS-LONDON, 1976, 123 (03): : 189 - 190
  • [10] BINARY LINEAR CODES WITH NEAR-EXTREMAL MAXIMUM DISTANCE
    Pongracz, Andras
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (04) : 2300 - 2317
12345