New self-dual additive -codes constructed from circulant graphs

详细信息    查看全文

• 作者：Markus Grassl^a ; ^{markus.grassl@mpl.mpg.de} ; Masaaki Harada^b ; ^{mharada@m.tohoku.ac.jp}
• 关键词：Self-dual code ; Additive F4F4-code ; Circulant graph ; Quantum code
• 刊名：Discrete Mathematics
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：340
• 期：3
• 页码：399-403
• 全文大小：369 K
• 卷排序：340

文摘

In order to construct quantum [[n,0,d]][[n,0,d]] codes for (n,d)=(56,15)(n,d)=(56,15), (57,15)(57,15), (58,16)(58,16), (63,16)(63,16), (67,17)(67,17), (70,18)(70,18), (71,18)(71,18), (79,19)(79,19), (83,20)(83,20), (87,20)(87,20), (89,21)(89,21), (95,20)(95,20), we construct self-dual additive F4F4-codes of length nn and minimum weight dd from circulant graphs. The quantum codes with these parameters are constructed for the first time.