In this paper, a sufficient and necessary condition of quick trickle permutations is given from the point of inverse permutations. The bridge is built between quick trickle permutations and m-value logic functions. By...In this paper, a sufficient and necessary condition of quick trickle permutations is given from the point of inverse permutations. The bridge is built between quick trickle permutations and m-value logic functions. By the methods of the Chrestenson spectrum of m-value logic functions and the auto-correlation function of m-value logic functions to investigate the Chrestenson spectral characteristics and the auto-correlation function charac- teristics of inverse permutations of quick trickle permutations, a determinant arithmetic of quick trickle permutations is given. Using the results, it becomes easy to judge that a permutation is a quick trickle permutation or not by using computer. This gives a new pathway to study constructions and enumerations of quick trickle permutations.展开更多
Calculation of a variation of discrete Fourier transform.Chrestenson spectraof functions of n indeterminates over integer modulo m(composite integer),is con-sidered.Based on sparse matrix decomposition,two fast algori...Calculation of a variation of discrete Fourier transform.Chrestenson spectraof functions of n indeterminates over integer modulo m(composite integer),is con-sidered.Based on sparse matrix decomposition,two fast algorithms with complexityO(mnn∑ri=1pi)are given to calculate the Chrestenson spectra,where p1p2…p2 is theprime factor decomposition of m.展开更多
基金the Opening Foundation of State Key Labo-ratory of Information Security (20050102)
文摘In this paper, a sufficient and necessary condition of quick trickle permutations is given from the point of inverse permutations. The bridge is built between quick trickle permutations and m-value logic functions. By the methods of the Chrestenson spectrum of m-value logic functions and the auto-correlation function of m-value logic functions to investigate the Chrestenson spectral characteristics and the auto-correlation function charac- teristics of inverse permutations of quick trickle permutations, a determinant arithmetic of quick trickle permutations is given. Using the results, it becomes easy to judge that a permutation is a quick trickle permutation or not by using computer. This gives a new pathway to study constructions and enumerations of quick trickle permutations.
基金Supported by the National Natural Science Foundation of China(90104034)the 863 Program(2002AA141020)the Guangdong Provincial Natural Science Foundation(990336)
文摘Calculation of a variation of discrete Fourier transform.Chrestenson spectraof functions of n indeterminates over integer modulo m(composite integer),is con-sidered.Based on sparse matrix decomposition,two fast algorithms with complexityO(mnn∑ri=1pi)are given to calculate the Chrestenson spectra,where p1p2…p2 is theprime factor decomposition of m.
