Results 31 to 40 of about 71,552 (319)
CYCLIC PERMUTATIONS IN KAZAMA-SUZUKI STRING MODELS [PDF]
Moddings by cyclic permutation symmetries are performed on four-dimensional strings, built from N=2 coset models of the type CPm=SU(m+1)/[SU(m)×U(1)]. For some illustrative cases, the massless chiral and antichiral states of E6 are computed. The extent of the equivalence between different conformal invariant theories which possess equal chiral rings ...
Aldazabal, G. +3 more
openaire +4 more sources
Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm
For a given base graph, the lifted graph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the lifted graph corresponds to a quasi-cyclic (QC) protograph low-density parity-check (LDPC) code.
Xue-Qin Jiang +3 more
doaj +1 more source
We study lower and upper bounds for the maximum size of a set of pairwise cyclic colliding permutations.
Gérard Cohen, MALVENUTO, Claudia
openaire +2 more sources
Cyclic permutations for qudits in d dimensions [PDF]
AbstractOne of the main challenges in quantum technologies is the ability to control individual quantum systems. This task becomes increasingly difficult as the dimension of the system grows. Here we propose a general setup for cyclic permutations Xd in d dimensions, a major primitive for constructing arbitrary qudit gates.
Isdraila, Tudor-Alexandru +2 more
openaire +3 more sources
We apply the new orbifold duality transformations to discuss the special case of cyclic coset orbifolds in further detail. We focus in particular on the case of the interacting cyclic coset orbifolds, whose untwisted sectors are Z_\lambda(permutation ...
Bardakçi K. +8 more
core +2 more sources
Cyclically permutable representations of cyclic codes
A cyclically permutable code is a binary block code of length \(n\) such that each codeword has \(n\) distinct cyclic shifts and such that no codeword can be obtained by one or more cyclic shifts of another codeword. Cyclically permutable codes have been studied for several applications involving synchronization, code-division multiple access (CDMA ...
Smith, Derek H., Perkins, Stephanie
openaire +1 more source
Skew characters and cyclic sieving
In 2010, Rhoades proved that promotion on rectangular standard Young tableaux, together with the associated fake-degree polynomial, provides an instance of the cyclic sieving phenomenon.
Per Alexandersson +3 more
doaj +1 more source
The crossing number cr ( G ) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main goal of the paper is to state the crossing number of the join product K 2 , 3 + C n for the complete ...
Michal Staš
doaj +1 more source
The q-ary image of some qm-ary cyclic codes: permutation group and soft-decision decoding [PDF]
Using a particular construction of generator matrices of the q-ary image of qm-ary cyclic codes, it is proved that some of these codes are invariant under the action of particular permutation groups.
Delpeyroux, Emmanuelle, Lacan, Jérôme
core +1 more source
Chosen-Key Secure Even-Mansour Cipher from a Single Permutation
At EUROCRYPT 2015, Cogliati and Seurin proved that the 4-round Iterated Even-Mansour (IEM) cipher with Independent random Permutations and no key schedule EMIP4(k, u) = k⊕p4 ( k⊕p3 ( k⊕p2 (k⊕p1 (k⊕u)))) is sequentially indifferentiable from an ideal ...
Shanjie Xu, Qi Da, Chun Guo
doaj +1 more source

