Results 1 to 10 of about 163,882 (275)
On the Automorphisms of a Sfield [PDF]
Loo-Keng Hua
openalex +4 more sources
AUTOMORPHISM COMMUTATORS [PDF]
G. A. Miller
openalex +3 more sources
Quantum computation from dynamic automorphism codes [PDF]
We propose a new model of quantum computation comprised of low-weight measurement sequences that simultaneously encode logical information, enable error correction, and apply logical gates.
M. Davydova+3 more
semanticscholar +1 more source
Adiabatic paths of Hamiltonians, symmetries of topological order, and automorphism codes [PDF]
The recent"honeycomb code"is a fault-tolerant quantum memory defined by a sequence of checks which implements a nontrivial automorphism of the toric code. We argue that a general framework to understand this code is to consider continuous adiabatic paths
D. Aasen, Zhenghan Wang, M. Hastings
semanticscholar +1 more source
On the Automorphism Group of Polar Codes [PDF]
The automorphism group of a code is the set of permutations of the codeword symbols that map the whole code onto itself. For polar codes, only a part of the automorphism group was known, namely the lower-triangular affine group (LTA), which is solely ...
Marvin Geiselhart+4 more
semanticscholar +1 more source
A characterization of skew $b$-derivations in prime rings [PDF]
Let $R$ be a prime ring, $\alpha$ an automorphism of $R$ and $b$ an element of $Q$, the maximal right ring of quotients of $R$. The main purpose of this paper is to characterize skew $b$-derivations in prime rings which satisfy various differential ...
Shakir Ali+3 more
doaj +1 more source
Polar Codes for Automorphism Ensemble Decoding [PDF]
In this paper we deal with polar code automorphisms that are beneficial under low-latency automorphism ensemble (AE) decoding, and we propose polar code designs that have such automorphisms.
Charles Pillet+2 more
semanticscholar +1 more source
The Complete Affine Automorphism Group of Polar Codes [PDF]
Recently, a permutation-based successive cancellation (PSC) decoding framework for polar codes attracts much attention. It decodes several permuted codewords with indepen-dent successive cancellation (SC) decoders. Its latency thus can be reduced to that
Yuan Li+6 more
semanticscholar +1 more source
Automorphisms of thickenings [PDF]
J. P. E. Hodgson
openalex +3 more sources
On the automorphisms of hypersurfaces [PDF]
H. Matsumura, Paul Monsky
openalex +3 more sources