Results 31 to 40 of about 173,309,485 (168)
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
Classifying Equidistant Permutation Codes
ABSTRACT A permutation code of length n $n$ is a set of codewords, each of which contains every symbol of a set of size n $n$ exactly once. A permutation code in which any two distinct codewords differ in the same number of coordinates is called equidistant and that number is called the distance.
Patric R. J. Östergård +1 more
wiley +1 more source
Updating the Incomplete MOLS Table for v $v$ up to 100
ABSTRACT Incomplete transversal designs have wide application in the construction of other designs such as transversal designs, block designs, frames, statistical designs, and Latin rectangles. Other areas where they are used include telecommunications and network codes, obtaining physically unclonable functions, frequency hopping sequences and ...
R. Julian R. Abel +2 more
wiley +1 more source
Context‐free graphs and their transition groups
Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
Fault-Tolerant Logical Clifford Gates from Code Automorphisms
We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error-correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group, and impose ...
Hasan Sayginel +4 more
doaj +1 more source
Involutory permutation automorphisms of binary linear codes
We investigate the properties of binary linear codes of even length whose permutation automorphism group is a cyclic group generated by an involution. Up to dimension or co-dimension [Formula: see text], we show that there is no quasi-group code whose permutation automorphism group is isomorphic to [Formula: see text].
Fatma Altunbulak Aksu +2 more
openaire +5 more sources
Maximal independence and regularity of Al/Si distributions in disordered phyllosilicates 2:1
The distribution of aluminium cations in disordered phyllosilicates is analysed according to the concepts of maximal independence and regularity.As an extension of previous works, we analyse regularity in disordered Al/Si distributions in phyllosilicates 2:1. The method is based on an analysis of maximal independent sets in a labelled quotient graph of
Montauban Moreira de Oliveira Jr +1 more
wiley +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 +2 more sources
Artificial Intelligence‐Driven Inverse Design of Singlet Fission Candidates in the Acene family
In this work, we describe an AI‐driven inverse design platform predicting S1 and T1 energies across acenes with high accuracy. Using Hammett σ constants as descriptors and RNN models coupled with optimization algorithms, it efficiently explores ≈1014 structures, uncovering novel SF candidates from benzene to pentacene. Freely accessible at https://alba.
Rafael G. Uceda +9 more
wiley +1 more source

