Results 21 to 30 of about 640,896 (52)
Most switching classes with primitive automorphism groups contain graphs with trivial groups [PDF]
, 2015 The operation of switching a graph Gamma with respect to a subset X of the vertex set interchanges edges and non-edges between X and its complement, leaving the rest of the graph unchanged.
Cameron, Peter Jephson, Spiga, Pablo
core +2 more sources
Comparing decoding methods for quaternary linear codes [PDF]
, 2016 Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permutation automorphism group of a code C. Constructions of small PD-sets for partial decoding for two families of Z₄-linear codes (Hadamard and Kerdock) are ...
Barrolleta, Roland David +2 more
core +1 more source
GPU-Accelerated Automorphism Ensemble Decoding of Quantum LDPC Codes
Quantum computers promise breakthroughs on problems that are intractable for even the most powerful supercomputers. However, the building blocks of quantum computers, qubits, are fragile and susceptible to noise, which corrupts calculations. Quantum Error Correction (QEC) allows us to bypass those issues, but it requires fast and accurate classical ...
Stergios Koutsioumpas, Joschka Roffe
openaire +1 more source
Graph-Based Codes and Iterative Decoding [PDF]
, 2003 The field of error correcting codes was revolutionized by the introduction of turbo codes in 1993. These codes demonstrated dramatic performance improvements over any previously known codes, with significantly lower complexity.
Khandekar, Aamod Dinkar
core +1 more source
On linear codes admitting large automorphism groups
, 2017 Linear codes with large automorphism groups are constructed. Most of them are suitable for permutation decoding. In some cases they are also optimal. For instance, we construct an optimal binary code of length (Formula presented.) and dimension (Formula ...
SONNINO, Angelo +2 more
core +1 more source
A Decoding Algorithm for LDPC Codes Over Erasure Channels with Sporadic Errors [PDF]
, 2010 An efficient decoding algorithm for low-density parity-check (LDPC) codes on erasure channels with sporadic errors (i.e., binary error-and-erasure channels with error probability much smaller than the erasure probability) is proposed and its performance ...
Paolini, Enrico +9 more
core +1 more source
On automorphism groups of polar codes [PDF]
Over the past years, Polar codes have arisen as a highly effective class of linear codes, equipped with a decoding algorithm of low computational complexity.
Ma, Jicheng, Yan, Guiying
core +1 more source
On the automorphism groups of q-enveloping algebras of nilpotent Lie algebras [PDF]
, 2006 We investigate the automorphism group of the quantised enveloping algebra U of the positive nilpotent part of certain simple complex Lie algebras g in the case where the deformation parameter q \in \mathbb{C}^* is not a root of unity. Studying its action
Launois, Stephane
core
Comparing decoding methods for quaternary linear codes
, 2021 Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permutation automorphism group of a code C. Constructions of small PD-sets for partial decoding for two families of Z₄-linear codes (Hadamard and Kerdock) are ...
Barrolleta, Roland David +2 more
core
Wind Ensemble and Jazz Ensemble Concert (1971)
, 1971 Bismarck Junior College Department of Music Presents the Wind Ensemble and Jazz Ensemble. Conductor: Ervin Ely. Location: College Auditorium. Time: 2:00 pm (Sunday)
Bismarck Junior College Wind Ensemble
core +1 more source