Skip to content
Research Article Open access CC BY 4.0

On the Construction of Odd Length Quantum Codes

Manish Gupta, R. K. Narula, Divya Taneja

Journal of Advances in Mathematics and Computer Science · pp. 444–450 · Published 13 Jan 2015

10.9734/BJMCS/2015/15059

Abstract

In this paper, we endeavor for an extensive study of [[n,n-3,2]] codes of odd length. We begin with the computation of the linear programming bound on the dimension of distance 2 codes of odd length and show that the [[n,n-3,2]] codes are optimal. We next find their generator matrix, stabilizer structure and also show that these codes are impure or degenerate except the [[3,0,2]] code which is pure by convention. In degenerate codes, distinct errors do not necessarily take the code space to orthogonal space. So sometimes they can correct more errors than that they can identify and has the capacity to store more information than a nondegenerate code. The present paper also establishes the existence of ((2m+1,2^(2m-2),2)) codes from the ((2m,2^(2m-2),2)) codes for all m>1. We have also constructed another class of distance 2 codes which are constructed using distance 3 codes.

Additive codes stabilizer pure and impure codes linear programming bound.

Cited by 2

Undetected Error Probability for Quantum Codes

M. Gupta, R. Narula, Divya Taneja · 2015

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

2

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.