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 条
  • [41] On 1-systems of Q(6,q),q even
    Luyckx, D
    Thas, JA
    DESIGNS CODES AND CRYPTOGRAPHY, 2003, 29 (1-3) : 179 - 197
  • [42] MINIMAL CYCLIC CODES OF LENGTH 16pn, OVER GF(q) WHERE q IS PRIME POWER OF THE FORM 16k
    Singh, Vishvajit
    Pruthi, Manju
    Singh, Jagbir
    ADVANCES AND APPLICATIONS IN MATHEMATICAL SCIENCES, 2019, 19 (02): : 97 - 127
  • [43] RELATION BETWEEN THE MINIMUM WEIGHT OF A LINEAR CODE OVER GF(QM) AND ITS Q-ARY IMAGE OVER GF(Q)
    RABIZZONI, P
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 388 : 209 - 212
  • [44] On various parameters of Z(q)-simplex codes for an even integer q
    Pandian, P. Chella
    Durairajan, C.
    ALGEBRA & DISCRETE MATHEMATICS, 2015, 19 (02): : 243 - 253
  • [45] Efficient LDPC Codes over GF(q) for Lossy Data Compression
    Braunstein, Alfredo
    Kayhan, Farbod
    Zecchina, Riccardo
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 1978 - +
  • [46] Extended MinSum algorithm for decoding LDPC codes over GF(q)
    Declercq, D
    Fossorier, M
    2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, 2005, : 464 - 468
  • [47] Low-Density Parity Check Codes over GF (q)
    Davey, Matthew C.
    MacKay, David
    IEEE COMMUNICATIONS LETTERS, 1998, 2 (06) : 165 - 167
  • [48] Short Erasure Correcting LDPC IRA Codes over GF(q)
    Garrammone, Giuliano
    Matuz, Balazs
    2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
  • [49] An Upper Bound on the Minimum Distance of LDPC Codes over GF(q)
    Frolov, Alexey
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2885 - 2888
  • [50] ON THE EXISTENCE OF OPTIMUM CYCLIC BURST CORRECTING CODES OVER GF(Q)
    ABDELGHAFFAR, KAS
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (02) : 329 - 332
12345