Searching for "Codes over F4" – sorted by Relevance.
-
Nonbinary Quantum Stabilizer Codes
- bases. It generalizes the relationship between selforthogonal codes over F 4 and binary quantum codes
- Cited by 23 (0 self) – Add To MetaCart
-
Optimal Z_4 Linear Rate 1/2 Codes of Length ≤ 8
- . Keywords{Optimal linear codes, Codes over F 4 . 1 Introduction A quaternary linear [n; k] code C is a k
- Add To MetaCart
-
Nonbinary stabilizer codes over finite fields
- of additive codes over F4 of the binary case. This paper derives lower and upper bounds on the minimum
- Cited by 6 (4 self) – Add To MetaCart
-
Some Small Cyclic Convolutional Codes
- an infinite series of one-dimensional CCCs over F4 with length 3 and increasing constraint length (complexity
- Add To MetaCart
-
Complete weight enumerators of generalized doubly-even self-dual codes
- distance of doubly-even self-dual quaternary codes up through length 24. Over the field F4, doubly
- Cited by 3 (1 self) – Add To MetaCart
-
On Kissing Numbers in Dimensions 32 to 128
- -finding the F4 approach will regain the lead. n=40. We take n0 = 40, n1 =8,n2= 2, use a lexicographic code for A
- Cited by 2 (1 self) – Add To MetaCart
-
Simple rate-1/3 convolutional and tail-biting quantum error-correcting codes
- of their complexity advantages over F4-based codes. Specifically, we present rate-1/3 single-error-correcting F4based
- Cited by 3 (0 self) – Add To MetaCart
-
Chapter 1 Quantum error-correcting codes from algebraic curves
- of quantum stabilizer codes based on classical linear codes. Recall that an additive code of length n over F4
- Add To MetaCart
-
Convolutional and tail-biting quantum error-correcting codes
- label code L(S) to be the classical (5,2,4) self-orthogonal (doubly extended Reed-Solomon) code over F4
- Cited by 3 (1 self) – Add To MetaCart
-
The Shadow Theory of Modular and Unimodular Lattices
- over F 4 of length n and minimal distance d, then "Construction A" 2 produces a 3-modular lattice
- Cited by 9 (3 self) – Add To MetaCart

