首页|Optimal Asymmetric Quantum Codes from the Euclidean Sums of Linear Codes

Optimal Asymmetric Quantum Codes from the Euclidean Sums of Linear Codes

扫码查看
原文链接
  • 万方数据
  • 维普
In this paper,we first give the definition of the Euclidean sums of linear codes,and prove that the Euclidean sums of linear codes are Euclidean dual-containing.Then we construct two new classes of optimal asymmetric quantum error-correcting codes based on Euclidean sums of the Reed-Solomon codes,and two new classes of optimal asymmetric quantum error-correcting codes based on Euclid-ean sums of linear codes generated by Vandermonde matrices over finite fields.Moreover,these optimal asymmetric quantum error-correcting codes constructed in this paper are different from the ones in the literature.

Euclidean sums of linear codesoptimal asymmetric quantum errorcorrecting codesvandermonde matricesReed-Solomon codes

XU Peng、LIU Xiusheng

展开 >

School of Science and Technology,College of Arts and Science of Hubei Normal University,Huangshi 435109,Hubei,China

Scientific Research Foundation of Hubei Provincial Education Department of ChinaNational Science Foundation of Hubei Polytechnic University of ChinaNational Science Foundation of Hubei Polytechnic University of China

Q2017450312xjz14A17xjz03A

2024

10.1051/wujns/2024291045

武汉大学自然科学学报(英文版)
武汉大学

武汉大学自然科学学报(英文版)

CSTPCD
影响因子：0.066
ISSN：1007-1202
年,卷(期)：2024.29(1)
  • 22