Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quantum Block and Synchronizable Codes Derived from Certain Classes of Polynomials (1508.00974v1)

Published 5 Aug 2015 in cs.IT and math.IT

Abstract: One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical codes, we are able to obtain some new quantum codes. It turns out that some of quantum codes exhibited here have better parameters than the ones available in the literature. Meanwhile, we give a new class of quantum synchronizable codes with highest possible tolerance against misalignment from duadic codes.

Citations (3)

Summary

We haven't generated a summary for this paper yet.