On the asymptotic number of inequivalent binary self-dual codes

Let Ψn be the number of inequivalent self-dual codes in . We prove that , where . Let Δn be the number of inequivalent doubly even self-dual codes in . We also prove that .     

接近非相干水声通信信道容量的信号处理算法

恶劣情况下的非相干水声通信信道模型为随机相位Rayleigh衰落,推导了该模型的信道容量曲线。为实现接近非相干信道容量的可靠通信,提出多进制低密度校验码(LDPC)和恒重码级联码的多进制非相干概率域迭代处理算法。在信道幅度和相位完全未知的情况下,根据矩估计得到信号和噪声频点幅度的统计参量,进而得到恒重码的码字后验概率,再对多进制LDPC码进行因子图迭代译码。仿真证明本算法与现有的最大能量检测非迭代译码算法相比,与信道容量曲线的差距从4.5dB缩小至1.5dB。给出了实际海试湖试通信效果,频段为6~10kHz,数据速率为357bps,海试时近似垂直通信距离为5km,湖试时水平通信距离近3km、多径超过50mS,两种情况下无差错通信的信噪比门限为2dB,验证了本算法的优势。     

Algebro-geometric Constructions of Quasi Periodic Flows of the Discrete Self-dual Network Hierarchy and Applicationsℰ

In this paper we obtain the discrete integrable self-dual network hierarchy associated with a discrete spectral problem. On the basis of the theory of algebraic curves, the continuous flow and discrete flow related to the discrete self-dual network hierarchy are straightened using the Abel-Jacobi coordinates. The meromorphic function and the Baker-Akhiezer function are introduced on the hyperelliptic curve. Quasi-periodic solutions of the discrete self-dual network hierarchy are constructed with the help of the asymptotic properties and the algebra-geometric characters of the meromorphic function, the Baker-Akhiezer function and the hyperelliptic curve.     

Generation of Nonlinear Evolution Equations by Reductions of the Self-Dual Yang–Mills Equations

With the help of some reductions of the self-dual Yang Mills （briefly written as sdYM） equations, we introduce a Lax pair whose compatibility condition leads to a set of （2 ＋ 1）-dimensional equations. Its first reduction gives rise to a generalized variable-coefficient Burgers equation with a forced term. Furthermore, the Burgers equation again reduces to a forced Burgers equation with constant coefficients, the standard Burgers equation, the heat equation, the Fisher equation, and the Huxley equation, respectively. The second reduction generates a few new （2 ＋ 1）-dimensional nonlinear integrable systems, in particular, obtains a kind of （2 ＋ 1）-dimensional integrable couplings of a new （2 ＋ 1）- dimensional integrable nonlinear equation.     

关于自正交的整表代数码

整表代数是群代数的推广，它的理想是群代数码的推广．本文给出了整表代数的单边理想是自正交理想的必要充分条件．     

INVERSE EIGENVALUE PROBLEM OF HERMITIAN GENERALIZED ANTI-HAMILTONIAN MATRICES

§1　IntroductionWe considerthe following inverse eigenvalue problem offinding an n-by-n matrix A∈S such thatAxi =λixi,i =1,2 ,...,m,where S is a given set of n-by-n matrices,x1 ,...,xm(m≤n) are given n-vectors andλ1 ,...,λmare given constants.Let X=(x1 ,...,xm) ,Λ=(λ1 ,λ2 ,...,λm) ,then the above inverse eigenvalue problemcan be written as followsProblem Given X∈Cn×m,Λ=(λ1 ,...,λm) ,find A∈S such thatAX =XΛ,where S is a given matrix set.We also discuss the so-called opti…     

Performance Enhancement for Optical Fast Frequency-hopping CDMA Systems by BCH Channel Coding

In this paper, the impact of optical beat noise on the performance of optical fast frequency-hopping code-division multiple-access (FFH OCDMA) networks is analyzed. BCH/FFH-OCDMA to reduce the impact of optical beat noise is proposed. It is shown that, BCH/FFH-OCDMA has much better performance under the same bit rate, same chip time and same number of available wavelengths. Another advantage for BCH/FFH-OCDMA is that the code length of one-coincidence sequence will be shorter, which can greatly reduce the difficulty of fabrication for fiber gratings.     

Some Characterizations of Finite Hermitian Veroneseans

We characterize the finite Veronesean of all Hermitian varieties of PG(n,q²) as the unique representation of PG(n,q²) in PG(d,q), d n(n+2), where points and lines of PG(n,q²) are represented by points and ovoids of solids, respectively, of PG(d,q), with the only condition that the point set of PG(d,q) corresponding to the point set of PG(n,q²) generates PG(d,q). Using this result for n=2, we show that is characterized by the following properties: (1) ; (2) each hyperplane of PG(8,q) meets in q²+1, q³+1 or q³+q²+1 points; (3) each solid of PG(8,q) having at least q+3 points in common with shares exactly q²+1 points with it.51E24     

Spreading Code Design Using a Global Optimization Method

The performance of a code division multiple access system depends on the correlation properties of the employed spreading code. Low cross-correlation values between spreading sequences are desired to suppress multiple access interference and to improve bit error performance. An auto-correlation function with a distinct peak enables proper synchronization and suppresses intersymbol interference. However, these requirements contradict each other and a trade-off needs to be established. In this paper, a global two dimensional optimization method is proposed to minimize the out-of-phase average mean-square aperiodic auto-correlation with average mean-square aperiodic cross-correlation being allowed to lie within a fixed region. This approach is applied to design sets of complex spreading sequences. A design example is presented to illustrate the relation between various correlation characteristics. The correlations of the obtained sets are compared with correlations of other known sequences.     

Very Singular Similarity Solutions and Hermitian Spectral Theory for Semilinear Odd-order PDEs

Asymptotic large- and short-time behavior of solutions of the linear dispersion equation μt = Uxxx in IR× IR＋, and its （2k＋l）th-order extensions are studied. Such a refined scattering is based on a ＂Hermitian＂ spectral theory for a pair {B,B＊} of non self-adjoint rescaled operators