ON LINEAR MDS CODES OF LENGTH Q + 1 OVER GF(Q) FOR EVEN Q

被引：8
|
作者：
DUR, A
机构：
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES A | 1988年 / 49卷 / 01期
关键词：
D O I：
10.1016/0097-3165(88)90032-5
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：172 / 174
页数：3
相关论文
共 50 条
  • [31] Decoding algorithms for nonbinary LDPC codes over GF(q)
    Declercq, David
    Fossorier, Marc
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2007, 55 (04) : 633 - 643
  • [32] On the Multiple Threshold Decoding of LDPC codes over GF(q)
    Frolov, Alexey
    Zyablov, Victor
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2673 - 2677
  • [33] ON THE MULTIPLE THRESHOLD DECODING OF LDPC CODES OVER GF(q)
    Frolov, Alexey
    Zyablov, Victor
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2017, 11 (01) : 123 - 137
  • [34] CYCLIC CODES OVER GF(Q) WITH SIMPLE ORBIT STRUCTURE
    CLARK, WE
    DISCRETE MATHEMATICS, 1986, 61 (2-3) : 151 - 164
  • [35] ON THE DIMENSION AND MINIMUM DISTANCE OF BCH CODES OVER GF(q)
    Yue Dianwu Hu Zhengming(Dept. of Information Engineering
    JournalofElectronics(China), 1996, (03) : 216 - 221
  • [36] A Stopping Criterion for Nonbinary LDPC Codes Over GF(q)
    Chen, Xin
    Men, Aidong
    Zhou, Wei
    2008 11TH IEEE SINGAPORE INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS (ICCS), VOLS 1-3, 2008, : 1312 - 1315
  • [37] Combine LDPC codes over GF(q) with q-ary modulations for bandwidth efficient transmission
    Rong, Bo
    Jiang, Tao
    Li, Xiangming
    Soleymani, Mohammad Reza
    IEEE TRANSACTIONS ON BROADCASTING, 2008, 54 (01) : 78 - 84
  • [38] 2 CLASSES OF CONVOLUTIONAL-CODES OVER GF(Q) FOR Q-ARY ORTHOGONAL SIGNALING
    RYAN, WE
    WILSON, SG
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1991, 39 (01) : 30 - 40
  • [39] ON MDS CODES, ARCS IN PG(N, Q) WITH Q EVEN, AND A SOLUTION OF 3 FUNDAMENTAL PROBLEMS OF B-SEGRE
    BRUEN, AA
    THAS, JA
    BLOKHUIS, A
    INVENTIONES MATHEMATICAE, 1988, 92 (03) : 441 - 459
  • [40] On 1-Systems of Q(6, q), q Even
    D. Luyckx
    J. A. Thas
    Designs, Codes and Cryptography, 2003, 29 : 179 - 197
12345