Specifically, for fixed values ( q, n, k 1, k 2, c ) (or ( q, n, ℓ = k 1 + k 2, c )), Is ensured by a version of Gilbert-Varshamov bounds.
#Quantum error correction and orthogonal geometry code
Q, n, c, and ℓ = k 1 + k 2 with which existence of a quantum code In order to quantify the maximum possible distances for a given parameters We choose the same q, n, c, and ℓ = k 1 + k 2įor a tuple of q, n, c and ℓ = k 1 + k 2, TABLE I: Comparison between the proposed Theorem 2Īnd the conventional Theorem 4 for the parameters We have ( → v x, → v z ) ∉ ( C ⊥ s ∖ ( C ∩ C ⊥ s ) ).Īn ] q EAQECC over the field F q. W H ( → v x ) ≤ d x − 1 and w H ( → v z ) ≤ d z − 1 Then there exists an F q-linear code C ⊆ F 2 n q such that dim C = ℓ,
0 kommentar(er)
