伪随机编码超宽带短脉冲的探测能力研究

 为进行弱信号检测，研究在脉冲雷达中获得大信号时间宽度与信号带宽积的方法，利用伪随机编码方法调制超宽带短脉冲，可以在保持子脉冲信号带宽的情况下，以低功率发射长脉冲串类噪声信号，而提高信号的能量，提高探测距离。通过仿真实验得出，利用伪随机编码技术可以使超宽带信号具有更强的探测能力，可以在回波信号功率水平远远小于噪声水平（如信噪比5%）的情况下实现对探测目标的高保真成像。     

中子俘获瞬发γ射线数据评价(英文)

简要地介绍了中子俘获瞬发γ射线数据及其衰变纲图的评价方法技术、主要程序及其功能、数据评价流程、强度平衡检验，以及对A=1-44的稳定核素和A>190的部分稳定核素的热中子俘获瞬发γ射线数据及其衰变纲图评价的具体应用.The method of prompt γ-ray data evaluation for neutron capture and how to calculate the prompt γ-ray intensities of neutron capture have been briefly presented. The prompt γ-ray data of thermal-neutron capture of some stable nuclei for A=1-44 and A>190 have been evaluated. The ENSDF format has been adopted. The checks of intensity balance and format have been made. The examples are given to illustrate its application.     

条形码技术的国际发展趋势及我国的对策

介绍了供应链管理中的一个得力工具——条形码技术，对这一技术进行了剖析，分析了条形码技术的国际发展趋势以及在我国的应用现状，最后针对我国在实现条形码技术时所遇到的各种问题提出了一些建议。     

基于自相关的激光编码解算

分析了半自主激光制导武器的激光编码规律，提出了运用自相关技术对激光编码进行解算。通过仿真试验验证，运用该技术可准确预测、精确同步复制敌方激光编码，并形成有效的激光诱饵，达到全程自适应干扰的目的。     

Extremal Self-Dual [50, 25, 10] Codes with Automorphisms of Order 3 and Quasi-Symmetric 2-(49, 9,6) Designs

Five non-isomorphic quasi-symmetric 2-(49, 9, 6) designs are known. They arise from extremal self-dual [50, 25, 10] codes with a certain weight enumerator. Four of them have an automorphism of order 3 fixing two points. In this paper, it is shown that there are exactly 48 inequivalent extremal self-dual [50, 25, 10] code with this weight enumerator and an automorphism of order 3 fixing two points. 44 new quasi-symmetric 2-(49, 9, 6) designs with an automorphism of order 3 are constructed from these codes.     

The Two-Point Codes with the Designed Distance on a Hermitian Curve in Even Characteristic

In Homma M and Kim SJ [2], the authors considered two-point codes on a Hermitian curve defined over fields of odd characteristic. In this paper, we study the geometry of a Hermitian curve over fields of even characteristic and classify the two-point codes whose minimum distances agree with the designed ones.     

Two-point AG codes from the Beelen-Montanucci maximal curve

In this paper we investigate two-point algebraic-geometry codes (AG codes) coming from the Beelen-Montanucci (BM) maximal curve. We study properties of certain two-point Weierstrass semigroups of the curve and use them for determining a lower bound on the minimum distance of such codes. AG codes with better parameters with respect to comparable two-point codes from the Garcia-Güneri-Stichtenoth (GGS) curve are discovered.     

Two new bounds on the size of binary codes with a minimum distance of three

We prove two new upper bounds on the size of binary codes with a minimum distance of three, namelyA(10, 3)76 andA(11, 3)152.     

On the classification of geometric codes by polynomial functions

It is shown how to represent algebraically all functions that have a zero sum on all -dimensional subspaces ofPG(n,q) or ofAG(n,q). In this way one can calculate the dimensions of related codes, or one can represent interesting sets of points by functions.