Construction and count of multi-output rotation symmetric resilient functions with 8 input variables

The value ranges of the number of output variables were determined respectively under the existence of multi-output rotation symmetric balanced functions and resilient functions with 2^rinput variables.Based on the equivalence between the resilient functions and large sets of orthogonal arrays,some results on the construction and count of multi-output rotation symmetric balanced functions with 8 input variables were presented according to the different dimensions of output vectors,and construction and count of multi-output rotation symmetric 1-resilient functions with 8 input variables were also studied.Besides,constructions of multi-output rotation symmetric resilient functions are transformed into the problem of solving a system of equations.     

Construction and Count of 1-Resilient Rotation Symmetric Boolean Functions on 4p Variables

This paper studies the properties of orbit matrix and gives a formula to compute the number of these orbit matrices on 4p variables, where p is an odd prime. It has been demonstrated that the construction of 1-resilient Rotation symmetric Boolean functions (RSBFs) on 4p variables is equivalent to solving an equation system. By the proposed method, all 1-resilient RSBFs on 12 variables can be constructed. We present a counting formula for the total number of all 1-resilient RSBFs on 4p variables. As application of our method, some 1-resilient RSBFs on 12 variables are presented.     

Tr（...）的二阶非线性度下界

作为影响系统安全的重要因素,对称密码中的密码函数应具有较高的r阶非线性度。对于r>1,目前对r阶非线性度的研究主要根据布尔函数微商的非线性度与其二阶非线性度之间的关系来进行。对于正整数n≡2（mod 4）,确定了一类布尔函数Tr(x^{2n/2+2n/2-1+1})的二阶非线性度下界。与相同变元数的两类已知布尔函数相比,研究的函数具有更紧的二阶非线性度下界。     

Wide-sense and strict-sense nonblocking operation of multicastmulti-log2 n switching networks

Multicast connections are used in broad-band switching networks as well as in parallel processing. We consider wide-sense and strict-sense nonblocking conditions for multi-log₂ N switching networks with multicast connections. We prove that such networks are wide-sense nonblocking if they are designed by vertically stacking at least t · 2^n-t-1 + 2 ^n-2t-1 planes of a log₂ N networks together, where 1 ⩽ t ⩽ [n/2] and t defines the size of a blocking window K = 2^t. For t = [n/2] and n even, and for [n/2] ⩽ t ⩽ n the number of planes must be at least t · 2^n-t-1 + 1 and 2^t + (n - t - 1) · 2^n-t-1 - 2^2t-n-1 + 1, respectively. In the case of strict-sense nonblocking switching networks, the number of planes is at least N/2. The results obtained in this paper show that in many cases number of planes in wide-sense nonblocking switching networks is less than those for t = [n/2] considered by Tscha and Lee (see ibid., vol.47, p.1425-31, Sept. 1999). The number of planes given in the paper is the minimum number of planes needed for wide-sense nonblocking operation provided that Algorithm 1 is used for setting up connections. The minimum number of planes for such operation in general is still open issue     

旋转对称布尔函数线性结构的2个公开问题

证明了代数次数为 的偶变元平衡旋转对称布尔函数不存在非零线性结构这个公开问题,给出了代数次数为 的奇变元旋转对称布尔函数不存在非零线性结构这个公开问题成立的充分条件和不成立的必要条件。     

Bent函数和弹性函数的最小距离

研究了Bent函数和弹性函数的最小距离,给出了求Bent函数和弹性函数的最小距离的一个新算法,得到了Bent函数和弹性函数最小距离新的下限,新的下限在一阶情形优于S.Maity等人在2004年给出的结果,同时证实了他们所提出的猜想,并且得到了12元、14元Bent函数和一阶弹性函数的最小距离.     

Bent函数的一种迭代构造

对于不小于4的偶数n,建立了由4个n-元Bent函数构造(n+2)-元Bent函数的一个充要条件.提出了由n-元Bent函数构造(n+2)-元Bent函数的一种迭代构造方法,也对所构造的Bent函数的代数次数进行了分析.这种迭代方法统一并推广了以前的两种Bent函数的构造.     

A non-Shannon-type conditional inequality of information quantities

Given n discrete random variables Ω={X₁,…,X_n}, associated with any subset α of {1,2,…,n}, there is a joint entropy H(X_α) where X_α={X_i: i∈α}. This can be viewed as a function defined on 2^{1,2,…,n} taking values in [0, +∞). We call this function the entropy function of Ω. The nonnegativity of the joint entropies implies that this function is nonnegative; the nonnegativity of the conditional joint entropies implies that this function is nondecreasing; and the nonnegativity of the conditional mutual information implies that this function is two-alternative. These properties are the so-called basic information inequalities of Shannon's information measures. An entropy function can be viewed as a 2ⁿ -1-dimensional vector where the coordinates are indexed by the subsets of the ground set {1,2,…,n}. As introduced by Yeng (see ibid., vol.43, no.6, p.1923-34, 1997) Γ_n stands for the cone in IR(2ⁿ-1) consisting of all vectors which have all these properties. Let Γ_n* be the set of all 2ⁿ -1-dimensional vectors which correspond to the entropy functions of some sets of n discrete random variables. A fundamental information-theoretic problem is whether or not Γ¯_n*=Γ_n. Here Γ¯_n * stands for the closure of the set Γ_n*. We show that Γ¯_n* is a convex cone, Γ₂*=Γ₂, Γ₃*≠Γ₃, but Γ¯₃ *=Γ₃. For four random variables, we have discovered a conditional inequality which is not implied by the basic information inequalities of the same set of random variables. This lends an evidence to the plausible conjecture that Γ¯_n*≠Γ_n for n>3     

On the dynamics of population inversion for 3 μm Er3+lasers

A generalized model for 3-μm (⁴I_11/2 →⁴I_13/2)Er lasers is proposed. The essential energy transfer processes present in the single-doped Er ³⁺ systems (up-conversion from ⁴I_13/2, up-conversion from ⁴ I_11/2, cross-relaxation from ⁴S _3/2), as well as those present in Cr³⁺ codoped Er ³⁺ systems, are taken into account. In the frame of this model, the main features of 3 μm Er³⁺ lasers, such as long pulse or CW operation, the change of emission wavelength as a function of pumping conditions, and the effects of codoping with Ho³⁺ or Tm³⁺ ions, are explained     

Chemically produced XeF(B) electronic excited state

Ultraviolet (UV) emission has been observed in the reactions of XeF₂+F₂+SiH₄ and XeF₂+F₂+F+B₂H₆. The emission spectra have been identified with the B²Σ→X²Σ transition of XeF. The emission intensity has also been examined as functions of the XeF₂, F₂, SiH₄, and Ar concentrations. Possible mechanisms of XeF(B) production are discussed     

Almost k -Wise Independent Sample Spaces and Their Cryptologic Applications

An almost k -wise independent sample space is a small subset of m bit sequences in which any k bits are ``almost independent'. We show that this idea has close relationships with useful cryptologic notions such as multiple authentication codes (multiple A -codes), almost strongly universal hash families, almost k -resilient functions, almost correlation-immune functions, indistinguishable random variables and k -wise decorrelation bias of block ciphers. We use almost k -wise independent sample spaces to construct new efficient multiple A -codes such that the number of key bits grows linearly as a function of k (where k is the number of messages to be authenticated with a single key). This improves on the construction of Atici and Stinson \cite{AS96}, in which the number of key bits is Ω (k ² ) . We introduce the concepts of ɛ -almost k -resilient functions and almost correlation-immune functions, and give a construction for almost k -resilient functions that has parameters superior to k -resilient functions. We also point out the connection between almost k -wise independent sample spaces and pseudorandom functions that can be distinguished from truly random functions, by a distinguisher limited to k oracle queries, with only a small probability. Vaudenay \cite{Vaudenay99} has shown that such functions can be used to construct block ciphers with a small decorrelation bias. Finally, new bounds (necessary conditions) are derived for almost k -wise independent sample spaces, multiple A -codes and balanced ɛ -almost k -resilient functions. Received September 1999 and revised January 2001 Online publication 29 August 2001     

Some results on the algebraic immunity of Boolean functions

From the motivation of algebraic attacks on stream and block ciphers,the concept of algebraic immunity(AI) of a Boolean function was introduced and studied extensively.High algebraic immunity is a necessary condition for resisting algebraic attacks.In this paper,we give some lower bounds on the algebraic immunity of Boolean functions.The results are applied to give lower bounds on the AI of symmetric Boolean functions and rotation symmetric Boolean functions.Some balanced rotation symmetric Boolean functions with their AI near the maximum possible value「n/2」are constructed.     

A Useful Technique for Interference Analysis in Nakagami Fading

This paper presents a unified analytical method for computing the average E[g(x/(Sigma_k=1 ^K y_k + b))] of some arbitrary function g(.) when x is a gamma random variable and independent of the arbitrary random variables y₁, y₂, ..., y_k. This leads to new explicit expressions for the averages of some specific functions including, erfc(radicz), exp(-z), zⁿ, and In(1 + z), in terms of the moment generating functions of y₁, y₂, ..., y_K.     

Low complexity affine MMSE detector for iterative detection-decoding MIMO OFDM systems

Iterative turbo processing between detection and decoding shows near-capacity performance on a multiple-antenna system. Combining iterative processing with optimum front-end detection is particularly challenging because the front-end maximum a posteriori (MAP) algorithm has a computational complexity that is exponential. Sub-optimum detector such as the soft interference cancellation linear minimum mean square error (SIC-LMMSE) detector with near front-end MAP performance has been proposed in the literature. The asymptotic computational complexity of SIC-LMMSE is O(n_t ²n_r + n_tn_r ³ + n_tM_c2^Mc) per detection-decoding cycle where n_t is number of transmit antenna, nr is number of receive antenna, and Mc is modulation size. A lower complexity detector is the hard interference cancellation LMMSE (HIC-LMMSE) detector. HIC-LMMSE has asymptotic complexity of O(n_t ²n_r + n_tM_c2^Mc) but suffers extra performance degradation. In this paper, two front-end detection algorithms are introduced that not only achieve asymptotic computational complexity of O(n_t ²n_r + n_tn_r ² [Gamma (beta) + 1] + n_tM_c2^Mc) where Gamma(beta) is a function with discrete output {-1, 2, 3, ...,n_t} and O(n_tM_c2^Mc) respectively. Simulation results demonstrate that the proposed low complexity detection algorithms offer exactly same performance as their full complexity counterpart in an iterative receiver while being computational more efficient.     

Theoretical analysis of word-level switching activity in thepresence of glitching and correlation

This paper presents a novel analytical approach to compute the switching activity in digital circuits at the word level in the presence of glitching and correlation. The proposed approach makes use of signal statistics such as mean, variance, and autocorrelation. It is shown that the switching activity α_f at the output node f of any arbitrary circuit in the presence of glitching and correlation is computed as α_f=Σ_i=1^S-1α(f _i,i+1)=Σ_i=1^{S- 1}p(f_i+1)(1-p(f_i))(1-ρ(f_i,i+1 )) (1) where ρ(f_i,i+1)=ρ(f_i,i+1)=(E[f_i(Sn)f _i+1(Sn)]- p(f_i)p(f_i+1))/(√(p(f _i)-p(f_i)²)(p(f_i+1)- p(f_i+1²))) (2). S number of time slots in a cycle; ρ(f_i,+1) time-slot autocorrelation coefficient; E[x]=expected value of x; p_x=probability of the signal x being “one”. The switching activity analysis of a signal at the word level is computed by summing the activities of all the individual bits constituting the signal. It is also shown that if the correlation coefficient of the higher order bits of a normally distributed signal x is ρ(x_c), then the bit P₀ where the correlation begins and the correlation coefficient is related hy ρ(x_c)=erfc{(2(P₀-1)-1)/(√2σ_x )} where erfc(x)=complementary error function; σ_x=variance of x. The proposed approach can estimate the switching activity in less than a second which is orders of magnitude faster than simulation-based approaches. Simulation results show that the errors using the proposed approach are about 6.1% on an average and that the approach is well suited even for highly correlated speech and music signals     

Cyclic codes over Z4, locator polynomials, and Newton'sidentities

Certain nonlinear binary codes contain more codewords than any comparable linear code presently known. These include the Kerdock (1972) and Preparata (1968) codes that can be very simply constructed as binary images, under the Gray map, of linear codes over Z₄ that are defined by means of parity checks involving Galois rings. This paper describes how Fourier transforms on Galois rings and elementary symmetric functions can be used to derive lower bounds on the minimum distance of such codes. These methods and techniques from algebraic geometry are applied to find the exact minimum distance of a family of Z ₄. Linear codes with length 2^m (m, odd) and size 2(2^m+1-5m-2). The Gray image of the code of length 32 is the best (64, 2³⁷) code that is presently known. This paper also determines the exact minimum Lee distance of the linear codes over Z₄ that are obtained from the extended binary two- and three-error-correcting BCH codes by Hensel lifting. The Gray image of the Hensel lift of the three-error-correcting BCH code of length 32 is the best (64, 2³²) code that is presently known. This code also determines an extremal 32-dimensional even unimodular lattice     

Impact of Ge implantation on the electrical characteristics of TiSi2 p+/n shallow junctions with an a-Si (or apoly-Si) buffer layer

A new technology for forming a titanium-silicide shallow junction by combining germanium implantation with an amorphous-silicon (or a poly-silicon) buffer layer has been proposed for MOSFETs. The use of a buffer layer between Ti and Si can avoid the consumption of bulk-silicon and the recession of TiSi₂ film into the source/drain junctions during the silicidation process. In this study, the important role of germanium-implantation on the formation of TiSi₂ contacted p⁺/n junctions was examined. After subsequent implantation of Ge⁺ and B⁺ into the TiSi₂ film, samples were annealed at different temperatures to form p ⁺/n junctions and C54-TiSi₂. Since the penetration of titanium atoms was suppressed due to the germanium-implantation, the periphery leakage and the generation leakage were improved and TiSi₂/Si interfaces were even smooth. Therefore, p⁺/n junctions with a very low leakage current (0.192 nA/cm ² at -5 V) and an excellent forward ideality factor (n≈1.002) can be obtained. From the secondary ion mass spectrometry (SIMS) analysis, the junction depth is 400     

Faraday rotation effects of Mn2+-modifiedTb2O3-B2O3 glass in pulsedmagnetic field

We present the dynamical Faraday rotation of a terbium metaborate glass (25Tb₂O₃-75B₂O₃) modified with Mn²⁺ ions using pulsed magnetic fields, which reached up to ~16 T. The superexchange couplings of Tb³⁺-O ^2--Tb³⁺ or Tb³⁺-O^2--Mn²⁺ were magnetooptically observed at lower temperature. In particular, the enhancement of the Faraday rotation effect was obtained at 15 K with repetitional operation of the 16-T pulsed magnetic fields, resulting in the destruction of the dimer couplings. When the operated glasses were heated back to 300 K, only the Tb₂O₃-B₂O₃:Mn²⁺ exhibited a significant change in the Faraday rotation     

Design of Sigma–Delta Modulators With Arbitrary Transfer Functions

This paper addresses the design of sigma-delta modulators with arbitrary signal and noise transfer functions using a genetic algorithm (GA)-based search method. The objective function is defined to include the difference D between the magnitude of the frequency responses of the designed transfer functions and the ideal one, the quantizer gain lambda_critical for which the poles of the modulator start moving out of the unit circle, and the spread of the coefficients S. Stability can be improved by reducing lambda_critical while a smaller S reduces the implementation complexity. A GA searches for poles/zeros of the transfer functions to minimize the objective function D+w₁*lambda_critical+w₂*S, where w₁ and w₂ are two weighing factors. Numerical results demonstrate the effectiveness of the proposed method     

On ternary complementary sequences

A pair of real-valued sequences A=(a₁,a₂,...,a_N) and B=(b₁,b ₂,...,b_N) is called complementary if the sum R(·) of their autocorrelation functions R_A(·) and R_B(·) satisfies R(τ)=R_A(τ)+R _B(τ)=Σ_i=1^N$ -^τa_ia_i+τ+Σ_j=1 ^N-τb_jb_j+τ=0, ∀τ≠0. In this paper we introduce a new family of complementary pairs of sequences over the alphabet α₃=+{1,-1,0}. The inclusion of zero in the alphabet, which may correspond to a pause in transmission, leads both to a better understanding of the conventional binary case, where the alphabet is α₂={+1,-1}, and to new nontrivial constructions over the ternary alphabet α₃. For every length N, we derive restrictions on the location of the zero elements and on the form of the member sequences of the pair. We also derive a bound on the minimum number of zeros necessary for the existence of a complementary pair of length N over α₃. The bound is tight, as it is met by some of the proposed constructions, for infinitely many lengths