Results 21 to 30 of about 374 (164)
Generic BCH codes. Polynomial-norm error decoding
The classic Bose – Chaudhuri – Hocquenghem (BCH) codes is famous and well-studied part in the theory of error-correcting codes. Generalization of BCH codes allows us to expand the range of activities in the practical correction of errors.
Alexander V. Kushnerov +1 more
doaj +1 more source
On the computation of the automorphisms group of low density parity check codes using genetic algorithm [PDF]
The genetic algorithm (GA) is an adaptive metaheuristic search method based on the process of evolution and natural selection theory. It is an efficient algorithm used for solving the combinatorial optimization problems, e.g., travel salesman problem ...
Mehdi, Bellfkih El +6 more
core +2 more sources
Automorphism Ensemble Decoding of Reed–Muller Codes [PDF]
Accepted for Publication in IEEE Transactions on ...
Marvin Geiselhart +4 more
openaire +2 more sources
Properties of triple error orbits G and their invariants in Bose – Chaudhuri – Hocquenghem codes C7
This work is the further development of the theory of norms of syndromes: the theory of polynomial invariants of G-orbits of errors expands with the group G of automorphisms of binary cyclic BCH codes obtained by joining the degrees of cyclotomic ...
V. A. Lipnitski, A. U. Serada
doaj +1 more source
Automorphism groups of Grassmann codes
revised ...
Sudhir R. Ghorpade, Krishna V. Kaipa
openaire +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.
Margarita Davydova +3 more
doaj +1 more source
Faithfulness of actions on Riemann-Roch spaces [PDF]
Given a faithful action of a finite group G on an algebraic curve X of genus g > 1, we give explicit criteria for the induced action of G on the Riemann-Roch space H^0(X,O_X(D)) to be faithful, where D is a G-invariant divisor on X of degree at least ...
Koeck, Bernhard, Tait, Joseph
core +1 more source
Automorphism groups of Gabidulin-like codes [PDF]
Let K be a cyclic Galois extension of degree f over k and T a generator of the Galois group. For any v=(v_1,... , v_m)\in K^m such that v is linearly independent over k, and any 0< d < m the Gabidulin-like code C(v, T , d) is a maximum rank distance code in the space of f times m matrices over k of dimension fd. This construction unifies the ones
Dirk Liebhold, Gabriele Nebe
openaire +3 more sources
Automorphism groups of some AG codes [PDF]
added a reference, fixed error in remark ...
David Joyner, Amy Ksir
openaire +2 more sources
On the Addressability Problem on CSS Codes [PDF]
Recent discoveries in asymptotically good quantum codes have intensified research on their application in quantum computation and fault-tolerant operations.
Jérôme Guyot, Samuel Jaques
doaj +1 more source

