Pith. sign in

REVIEW

Xing-Ling Codes, Duals of their Subcodes, and Good Asymmetric Quantum Codes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1307.4532 v2 pith:3QD4YUUD submitted 2013-07-17 cs.IT math.IT

Xing-Ling Codes, Duals of their Subcodes, and Good Asymmetric Quantum Codes

classification cs.IT math.IT
keywords codesquantumasymmetricbestblockdeltaerrorsgood
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A class of powerful $q$-ary linear polynomial codes originally proposed by Xing and Ling is deployed to construct good asymmetric quantum codes via the standard CSS construction. Our quantum codes are $q$-ary block codes that encode $k$ qudits of quantum information into $n$ qudits and correct up to $\flr{(d_{x}-1)/2}$ bit-flip errors and up to $\flr{(d_{z}-1)/2}$ phase-flip errors.. In many cases where the length $(q^{2}-q)/2 \leq n \leq (q^{2}+q)/2$ and the field size $q$ are fixed and for chosen values of $d_{x} \in \{2,3,4,5\}$ and $d_{z} \ge \delta$, where $\delta$ is the designed distance of the Xing-Ling (XL) codes, the derived pure $q$-ary asymmetric quantum CSS codes possess the best possible size given the current state of the art knowledge on the best classical linear block codes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.