CYCLIC AND PSEUDO-CYCLIC MDS CODES OF LENGTH Q+1

被引：12
|
作者：
DAHL, C
PEDERSEN, JP
机构：
[1] Mathematical Institute, The Technical University of Denmark, DK-2800 Lyngby
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES A | 1992年 / 59卷 / 01期
关键词：
D O I：
10.1016/0097-3165(92)90104-3
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We explicitly show that cyclic and pseudo-cyclic MDS codes of length q + 1, obtained by a BCH-construction, are generalized Reed-Solomon codes. © 1992.
引用
收藏
页码：130 / 133
页数：4
相关论文
共 50 条
  • [1] Cyclic arcs and pseudo-cyclic MDS codes
    Maruta, T
    DISCRETE MATHEMATICS, 1997, 174 (1-3) : 199 - 205
  • [2] On the existence of cyclic and pseudo-cyclic MDS codes
    Maruta, T
    EUROPEAN JOURNAL OF COMBINATORICS, 1998, 19 (02) : 159 - 174
  • [3] CLASSIFICATION OF PSEUDO-CYCLIC MDS CODES
    PEDERSEN, JP
    DAHL, C
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (02) : 365 - 370
  • [4] Pseudo-cyclic Codes and the Construction of Quantum MDS Codes
    Li, Shuxing
    Xiong, Maosheng
    Ge, Gennian
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (04) : 1703 - 1710
  • [5] On some cyclic codes of length q2m-1/q+1
    Wu, Peng
    Li, Chengju
    Peng, Wei
    FINITE FIELDS AND THEIR APPLICATIONS, 2019, 60
  • [6] OPTIMAL PSEUDO-CYCLIC CODES AND CAPS IN PG(3,Q)
    MARUTA, T
    GEOMETRIAE DEDICATA, 1995, 54 (03) : 263 - 266
  • [7] MDS constacyclic codes of length q+1 over GF(q)
    Wang, Xiaoqiang
    Ding, Cunsheng
    Liu, Hongwei
    Zheng, Dabin
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2024, 16 (01): : 21 - 48
  • [8] Cyclic and pseudo-cyclic byte error-correcting codes
    Cleju, I
    Sîrbu, A
    ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 120 - 120
  • [9] ON CYCLIC MDS CODES OF LENGTH Q OVER GF(Q)
    ROTH, RM
    SEROUSSI, G
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (02) : 284 - 285
  • [10] New Optimal Cyclic Locally Recoverable Codes of Length n=2(q+1)
    Qian, Jianfa
    Zhang, Lina
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (01) : 233 - 239
12345