2000 character limit reached
Quantum Codes from Linear Codes over Finite Chain Rings
Published 21 Apr 2017 in cs.IT and math.IT | (1704.06375v1)
Abstract: In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-Shor-Steane (CSS) construction applied to self-dual codes over finite chain rings. The second construction is derived from the CSS construction applied to Gray images of the linear codes over finite chain ring $\mathbb{F}{p{2m}}+u\mathbb{F}{p{2m}}$. The good parameters of quantum codes from cyclic codes over finite chain rings are obtained.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.