Results 31 to 40 of about 374 (164)
On Calculation of Monomial Automorphisms of Linear Cyclic Codes [PDF]
© 2018, Pleiades Publishing, Ltd. A description of the monomial automorphisms group of an arbitrary linear cyclic code in term of polynomials is presented.
Kugurakov V. +2 more
core
Automorphism Groups of BWD-codes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Generalized Automorphisms of Channel Codes: Properties, Code Design, and a Decoder [PDF]
Low-density parity-check codes together with belief propagation (BP) decoding are known to be well-performing for large block lengths. However, for short block lengths there is still a considerable gap between the performance of the BP decoder and the ...
Schmalen, Laurent +2 more
core +1 more source
Spherical codes with prescribed signed permutation automorphisms inside shells of low-dimensional integer lattices [PDF]
Publisher Copyright: © 1963-2012 IEEE.Let S(n, t, k) be the maximum size of a code containing only vectors of the kth shell of the integer lattice Zn such that the inner product between distinct vectors does not exceed t.
Ganzhinov, Mikhail, Östergård, Patric
core +4 more sources
Automorphism groups and isometries for cyclic orbit codes
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 +4 more sources
Automorphisms of principal nilpotent self-dual codes in certain modular algebras [PDF]
We give a constructive characterization of codes which are self-dual, nilpotent and principal in a certain finite abelian group algebra over finite field.
Poli, A., Thiong-ly, J.A.
core +1 more source
Some designs and codes from L_2(q) [PDF]
For $q \in \{7,8,9,11,13,16\}$, we consider the primitive actions of $L_2(q)$ and use Key-Moori Method 1 as described in [Codes, designs and graphs from the Janko groups {$J_1$} and {$J_2$}, {\em J. Combin. Math. Combin.
Jamshid Moori +1 more
doaj
Constant 2-Labellings And An Application To (R, A, B)-Covering Codes
We introduce the concept of constant 2-labelling of a vertex-weighted graph and show how it can be used to obtain perfect weighted coverings. Roughly speaking, a constant 2-labelling of a vertex-weighted graph is a black and white colouring of its vertex
Gravier Sylvain, Vandomme Èlise
doaj +1 more source
Describing quaternary codes using binary codes [PDF]
PhDFor a quaternary code C of length n, de ne a pair of binary codes fC1;C2g as: -C1 = C mod 2 -C2 = h(C \ 2Zn 4 ) where h is a bijection from 2Z4 to Z2 mapping 0 to 0 and 2 to 1 and for the extension to a map acting coordinatewise.
Al Kharoosi, Fatma Salim Ali
core
An elegant model of the geodesic flow on the modular surface
Abstract Caroline Series' [The modular surface and continued fractions, J. Lond. Math. Soc. (2), 31, no. 1, (1985), 69–80] gives a clear framework linking, in a deceptively simple way, the dynamics of the geodesic flow on the modular surface with the dynamics of the regular continued fraction, through a well‐chosen symbolic coding.
Pierre Arnoux, Thomas A. Schmidt
wiley +1 more source

