New q-ary quantum MDS codes of length strictly larger than q+1

被引:0
|
作者
Kircali, Mustafa [1 ]
Ozbudak, Ferruh [1 ,2 ]
机构
[1] Middle East Tech Univ, Inst Appl Math, TR-06800 Ankara, Turkiye
[2] Sabanci Univ, Fac Engn & Nat Sci, TR-34956 Istanbul, Turkiye
关键词
Quantum MDS codes; Truncated code; Reed-Solomon code; Hermitian self-orthogonal code; CONSTACYCLIC CODES; CONSTRUCTION;
D O I
10.1007/s11128-024-04598-1
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Quantum information and quantum computation have become a hot topic in recent decades. Quantum error-correcting codes are useful and have many applications in quantum computations and quantum communications. We construct a new class of quantum Maximum Distance Separable (MDS) codes. Our construction is based on a recent result of Ball and Vilar (IEEE Trans Inf Theory 68:3796-3805, 2022). We study a large class of explicit polynomials and obtain their required arithmetical properties which imply construction of new q-ary quantum MDS codes of length strictly larger than q+1, when q is odd.
引用
收藏
页数:13
相关论文
共 50 条
  • [41] Some q-ary constacyclic BCH codes with length [Formula presented]
    Li, Jin
    Zhu, Huilian
    Zhu, Shixin
    Finite Fields and their Applications, 2025, 102
  • [42] Some new bounds for q-ary linear block codes
    Xiao, M
    Wang, XM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (05) : 1996 - 1998
  • [43] LOWER BOUNDS FOR Q-ARY COVERING CODES
    CHEN, W
    HONKALA, IS
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (03) : 664 - 671
  • [44] Polar Codes for Q-ary Source Coding
    Karzand, Mohammad
    Telatar, Emre
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 909 - 912
  • [45] QAM modulations with q-ary turbo codes
    张豫伟
    王新梅
    Science in China(Series E:Technological Sciences), 1997, (01) : 64 - 70
  • [46] QAM modulations with q-ary turbo codes
    Zhang, YW
    Wang, XM
    SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 1997, 40 (01): : 64 - 70
  • [47] Synchronizing codewords of q-ary Huffman codes
    Perkins, S
    Escott, AE
    DISCRETE MATHEMATICS, 1999, 197 (1-3) : 637 - 655
  • [48] LOWER BOUNDS FOR Q-ARY COVERING CODES
    CHEN, WD
    HONKALA, IS
    CHINESE SCIENCE BULLETIN, 1990, 35 (06): : 521 - 522
  • [49] Construction of Efficient q-ary Balanced Codes
    Mambou, Elie N.
    Swart, Theo G.
    2019 IEEE AFRICON, 2019,
  • [50] Binary and q-ary Tardos codes, revisited
    Skoric, Boris
    Oosterwijk, Jan-Jaap
    DESIGNS CODES AND CRYPTOGRAPHY, 2015, 74 (01) : 75 - 111