Results 21 to 30 of about 173,309,485 (168)
Automorphism groups of Gabidulin-like codes [PDF]
Archiv der Mathematik, 2016 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 +4 more sources
Semilattices with a group of automorphisms [PDF]
, 1997 We investigate semilattices expanded by a group F of automorphisms acting as new unary basic operations. We describe up to isomorphism all simple algebras of this kind in case that F is commutative.
Maróti, Miklós
core +1 more source
Automorphism groups of some AG codes [PDF]
IEEE Transactions on Information Theory, 2006 added a reference, fixed error in remark ...
David Joyner, Amy Ksir
openaire +3 more sources
On the Addressability Problem on CSS Codes [PDF]
QuantumRecent 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
Automorphism Groups of BWD-codes
Journal of Combinatorial Theory, Series A, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Normal automorphisms of relatively hyperbolic groups
, 2010 An automorphism of a group G is normal if it fixes every normal subgroup of G setwise. We give an algebraic description of normal automorphisms of relatively hyperbolic groups.
D. Osin +3 more
core +1 more source
Spherical codes with prescribed signed permutation automorphisms inside shells of low-dimensional integer lattices [PDF]
Let $\textrm{S}(n,t,k)$ be the maximum size of a code containing only vectors of the $k$th shell of the integer lattice $\mathbb{Z}^n$ such that the inner product between distinct vectors does not exceed $t$.
J, Östergård Patric R. +1 more
core +3 more sources
Group Properties of Polar Codes for Automorphism Ensemble Decoding [PDF]
, 2022 In this paper, we propose an analysis of the automorphism group of polar codes, with the scope of designing codes tailored for automorphism ensemble (AE) decoding. We prove the equivalence between the notion of decreasing monomial codes and the universal
Land, Ingmar +2 more
core +1 more source
Automorphism groups and isometries for cyclic orbit codes
Advances in Mathematics of Communications, 2023 We study orbit codes in the field extension ${\mathbb F}_{q^n}$. First we show that the automorphism group of a cyclic orbit code is contained in the normalizer of the Singer subgroup if the orbit is generated by a subspace that is not contained in a proper subfield of ${\mathbb F}_{q^n}$. We then generalize to orbits under the normalizer of the Singer
Heide Gluesing-Luerssen, Hunter Lehmann
openaire +5 more sources
On the computation of the automorphisms group of low density parity check codes using genetic algorithm [PDF]
, 2022 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 +12 more
core +1 more source