Results 81 to 90 of about 173,309,485 (168)

The existence of certain extremal [54,27,10] self-dual codes

open access: yes, 1996
Some new extremal binary [54,27,10] self-dual codes are constructed using automorphisms of order ...
Yorgov, V. Y., Tonchev, Vladimir
core   +1 more source

Automorphisms and coverings of Klein surfaces

open access: yes, 1977
In this thesis the theory of automorphisms and coverings of compact Klein surfaces is discussed by considering a Klein surface as the orbit space of a non-Euclidean crystallographic group.
Hall, Wendy
core   +1 more source

On a construction of self-orthogonal codes from orbit matrices of 2-designs [PDF]

open access: yes
In 2003, Harada and Tonchev presented a construction of self-orthogonal codes from orbit matrices of symmetric $2$-designs with fixed point free automorphisms.
Maksimović, Marija, Rukavina, Sanja
core   +1 more source

Replicable functions arising from code-lattice VOAs fixed by automorphisms

open access: yes, 2023
We ascertain properties of the algebraic structures in towers of codes, lattices, and vertex operator algebras (VOAs) by studying the associated subobjects fixed by lifts of code automorphisms.
Beneish, Lea   +5 more
core   +1 more source

2-(31,15,7), 2-(35,17,8) and 2-(36,15,6) designs with automorphisms of odd prime order, and their related Hadamard matrices and codes

open access: yes, 2009
We present the full classification of Hadamard 2-(31,15,7), Hadamard 2-(35, 17,8) and Menon 2-(36,15,6) designs with automorphisms of odd prime order. We also give partial classifications of such designs with automorphisms of order 2.
Bouyukliev, Iliya   +2 more
core   +1 more source

On the equivalence of codes and codes with an automorphism having two cycles

open access: yesDiscrete Mathematics, 1990
This paper presents results giving sufficient conditions under which two codes are equivalent. This technique has been applied to certain binary quasicyclic codes. Self-dual codes of length 2r or \(2r+2\) over arbitrary fields having an automorphism of prime order r have also been examined. This study has further been used to construct and to count the
openaire   +1 more source

Constituent Automorphism Decoding of Reed-Muller Codes

open access: yesIEEE Transactions on Communications
11 pages, 8 figures, 5 ...
Yicheng Qu   +2 more
openaire   +3 more sources

Polar Codes Do Not Have Many Affine Automorphisms

open access: yes
Polar coding solutions demonstrate excellent performance under the list decoding that is challenging to implement in hardware due to the path sorting operations. As a potential solution to this problem, permutation decoding recently became a hot research
Ivanov, Kirill, Urbanke, Rudiger
core   +1 more source

Home - About - Disclaimer - Privacy