Results 31 to 40 of about 6,509 (277)
Cyclically permutable representations of cyclic codes
Discrete Applied Mathematics, 2008 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
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
Mathematics, 2020 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
On knot separability of hypergraphs and its application towards infectious disease management
AIMS Mathematics, 2023 The article deals with some theoretical aspects of hypergraph connectivity from the knot view. The strength of knots is defined and investigates some of their properties.
Raju Doley, Saifur Rahman, Gayatri Das
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
Chosen-Key Secure Even-Mansour Cipher from a Single Permutation
IACR Transactions on Symmetric Cryptology, 2023 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
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
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 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
Congruences involving generalized Frobenius partitions
International Journal of Mathematics and Mathematical Sciences, 1993 The goal of this paper is to discuss congruences involving the function cϕm¯(n), which denotes the number of generalized Frobenius partitions of n with m colors whose order is m under cyclic permutation of the m colors.
James Sellers
doaj +1 more source