基于空间二进制编码的3 D形貌测量方法

介绍了一种基于空间二进制编码的非接触３ Ｄ 形貌测量方法。它用一台ＬＣＤ 投影仪对被测物体表面进行空间编码,再用一台ＣＣＤ 摄像机获取物体编码信息,最后用三角法原理从摄像机图像中获取三维形貌数据。提出了基于三角法的空间二进制码的重要特性,描述了高效编码的构造方法。用这个构造方法构造出一个完全数字化的７ 位字长的二进制编码。基于这种编码的３ Ｄ 形貌测量方法在被测物体表面非常不连续和非构造的环境下取得了良好的测量结果。     

Constructions of optimal difference systems of sets

Difference systems of sets (DSSs) are combinatorial configurations which were introduced in 1971 by Levenstein for the construction of codes for synchronization. In this paper, we present two kinds of constructions of difference systems of sets by using disjoint difference families and a special type of difference sets, respectively. As a consequence, new infinite classes of optimal DSSs are obtained.     

基于步进啁啾光纤光栅的OCDMA频阈相位编码

本文提出了一种在步进啁啾光纤光栅实现OCDMA频阈相位编码的方案,该方案中引入了影射码,根据影射码在相应的子光栅之间加入相移以实现正确的编解码.该编解码器结构简单,数值模拟得到了好的相关输出.     

螺旋线慢波结构高频特性的简化模拟方法

 利用3D电磁仿真软件HFSS中的Master/Slaver边界条件,基于螺旋线慢波结构的角向周期性,提出了一种改进的高频特性仿真方法。将具有3根夹持杆的螺旋线慢波结构的仿真模型从1个螺距的长度缩小到了1/3个螺距。仿真结果表明：采用改进后的模型,计算所得的相关高频特性参数与改进前传统模型所得结果基本一致,但是运算时间减少了至少3/4,且频率越高,计算时间上面的优势越大。     

Symplectic spread-based generalized Kerdock codes

Kerdock codes (Kerdock, Inform Control 20:182–187, 1972) are a well-known family of non-linear binary codes with good parameters admitting a linear presentation in terms of codes over the ring (see Nechaev, Diskret Mat 1:123–139, 1989; Hammons et al., IEEE Trans Inform Theory 40:301–319, 1994). These codes have been generalized in different directions: in Calderbank et al. (Proc Lond Math Soc 75:436–480, 1997) a symplectic construction of non-linear binary codes with the same parameters of the Kerdock codes has been given. Such codes are not necessarily equivalent. On the other hand, in Kuzmin and Nechaev (Russ Math Surv 49(5), 1994) the authors give a family of non-linear codes over the finite field F of q = 2 ^l elements, all of them admitting a linear presentation over the Galois Ring R of cardinality q ² and characteristic 2². The aim of this article is to merge both approaches, obtaining in this way new families of non-linear codes over F that can be presented as linear codes over the Galois Ring R. The construction uses symplectic spreads.      

Strengthened semidefinite programming bounds for codes

We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras. The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with O(n ⁷) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n ³), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s bound with the same computational complexity. Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203.     

��GATO����ģ��HL-2Aװ��ʵ���MHD�ȶ���

将理想全二维磁流体(MHD)稳定性数值代码GATO成功移植到HL-2A高性能计算系统,并用其模拟研究了HL-2A装置一次典型弹丸注入实验的等离子体的理想MHD稳定性。利用HL-2A装置第4050次放电的实验数据,应用EFIT代码重建了几个时间片的平衡位形,然后应用GATO代码对每个平衡位形的MHD稳定性进行了计算。通过对结果进行分析比较得出初步结论,由于弹丸注入而造成的反剪切位形的致稳作用,可以提高等离子体的约束性能。     

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,验证了本算法的优势。     

关于自正交的整表代数码

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