Results 41 to 50 of about 71,552 (319)
4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTION [PDF]
Journal of Algebraic Systems, 2021 Recently, a class of low-density parity-check codes based on affine permutation matrices, called APM-LDPC codes, have been considered which have some advantages than quasi-cyclic (QC) LDPC codes in terms of minimum-distance, cycle distribution, and error-
Z. Gholami, M. Gholami
doaj +1 more source
Generating a random cyclic permutation [PDF]
BIT, 1988 We prove correct an algorithm that, given \(n>0\), stores in array b[0..n- 1] a random cyclic permutation of the integers in 0..n-1, with each cyclic permutation having equal probability of being stored in b. The algorithm was developed by Sattolo; our contribution is to present a more convincing proof using standard program-proving methods.
Gries, David, Xue, Jinyun
openaire +2 more sources
Graphical cyclic permutation groups [PDF]
, 1981 A permutation group H acting on a set X is said to be graphical if there is a graph G such that Γ(G), the automorphism group of G, is identical to H. Characterisation of graphical permutation groups seems to be difficult. Kagno and Chao have shown that the group generated by a single m-cycle is not graphical.
S. P. Mohanty +2 more
openaire +1 more source
On the symmetry of good nonlinear codes [PDF]
, 1970 It is shown that there are arbitrarily long "good" (in the sense of Gilbert) binary block codes that are preserved under very large permutation groups. This result contrasts sharply with the properties of linear codes: it is conjectured that long cyclic ...
McEliece, Robert J.
core +1 more source
A linear time algorithm for the orbit problem over cyclic groups [PDF]
, 2014 The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same orbit with ...
Anthony Widjaja, Lin, Sanming Zhou
core +1 more source
ESAIM: Proceedings and Surveys, 2014 Let f:X → X be a continuous map defined from a topological space X into itself. We discuss the problem of analyzing and computing explicitly the set Per(fp) of periods of the p-th iterate ...
Cánovas J.S., Linero Bas A.
doaj +1 more source
Cyclic Permutations in Doubly-Transitive Groups [PDF]
, 1997 Let Ω be a finite set of size n. A cyclic permutation on Ω is a permutation whose cycle decomposition is one cycle of length n. This paper classifies all finite doubly-transitive permutation groups which contain a cyclic permutation.
McSorley, John P.
core +2 more sources
On the class of square Petrie matrices induced by cyclic permutations
International Journal of Mathematics and Mathematical Sciences, 2004 Let n≥2 be an integer and let P={1,2,…,n,n+1}. Let Zp denote the finite field {0,1,2,…,p−1}, where p≥2 is a prime. Then every map σ on P determines a real n×n Petrie matrix Aσ which is known to contain information on the dynamical properties such as ...
Bau-Sen Du
doaj +1 more source
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem [PDF]
, 2001 In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups, finding hidden
Ivanyos, Gabor +2 more
core +2 more sources
Encrypting Multiple Images With an Enhanced Chaotic Map
IEEE Access, 2022 A multiple-image encryption scheme based on an enhanced chaotic map is proposed. This scheme combines multiple grayscale images into three planes. An amplified sine map is used to generate a dynamic permutation table and a chaotic sequence.
Dolendro Singh Laiphrakpam +3 more
doaj +1 more source