Results 41 to 50 of about 825,768 (324)
Electronic Notes in Discrete Mathematics, 2013 We study lower and upper bounds for the maximum size of a set of pairwise cyclic colliding permutations.
Gérard Cohen, MALVENUTO, Claudia
openaire +3 more sources
In-situ inversion of a cyclic permutation [PDF]
Information Processing Letters, 1987 An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array. The emphasis is on the quo modo rather than the quod**; we are interested in finding concepts and notations for dealing more effectively with formal developments and proofs of such algorithms, rather than in this particular algorithm itself.
David Gries +2 more
openaire +2 more sources
Journal of Lightwave Technology, 2020 We have achieved the longest three mode-multiplexed full C-band transmission yet attained over 3060 km. In wideband mode-multiplexed transmission over weakly-coupled fewmode fibers (FMFs), the width of signal impulse responses is dependent on wavelength,
K. Shibahara +7 more
semanticscholar +1 more source
Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm
IEEE Access, 2017 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
Cyclically permutable representations of cyclic codes
Discrete Applied Mathematics, 2008 AbstractCyclically permutable codes have been studied for several applications involving synchronization, code-division multiple-access (CDMA) radio systems and optical CDMA. The usual emphasis is on finding constant weight cyclically permutable codes with the maximum number of codewords. In this paper the question of when a particular error-correcting
Stephanie Perkins, Derek H. Smith
openaire +2 more sources
On the crossing number of join product of the discrete graph with special graphs of order five
Electronic Journal of Graph Theory and Applications, 2020 The main aim of the paper is to give the crossing number of join product G+Dn for the disconnected graph G of order five consisting of the complete graph K4 and of one isolated vertex.
Michal Staš
doaj +1 more source
Cyclic permutable subgroups of finite groups [PDF]
Journal of the Australian Mathematical Society, 2001 AbstractThe authors describe the structure of the normal closure of a cyclic permutable subgroup of odd order in a finite group.
Stewart E. Stonehewer, John Cossey
openaire +4 more sources
Skew characters and cyclic sieving
Forum of Mathematics, Sigma, 2021 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 q-ary image of some qm-ary cyclic codes: permutation group and soft-decision decoding [PDF]
, 2002 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
Cyclic Permutation Groups that are Automorphism Groups of Graphs
Graphs and Combinatorics, 2019 In this paper we establish conditions for a permutation group generated by a single permutation to be an automorphism group of a graph. This solves the so called concrete version of König’s problem for the case of cyclic groups. We establish also similar
Mariusz Grech, A. Kisielewicz
semanticscholar +1 more source