Results 51 to 60 of about 975,846 (299)
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
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
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
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel [PDF]
, 2010 In this paper, we show that Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding over the binary erasure channel. We demonstrate that the quasi-cyclic structure of the parity-check matrix can be advantageously used in ...
Cunche, Mathieu +2 more
core +3 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
Flavor structure in D-brane models: Majorana neutrino masses [PDF]
, 2014 We study the flavor structure in intersecting D-brane models. We study anomalies of the discrete flavor symmetries. We analyze the Majorana neutrino masses, which can be generated by D-brane instanton effects.
Hamada, Yuta +2 more
core +2 more sources
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
Permutation-decodable binary cyclic codes
Electronics Letters, 1974 The letter develops bounds on the information rates of certain binary cyclic codes so that they are s-step permutation decodable (s=2, 3, 4).
null Pui-Wah Yip +2 more
openaire +1 more source