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.     

Solid codes and the uniform density of fd-domains

By means of further investigation of solid codes,the problem“Is every fd-domain uni- formly dense”proposed by Yuqi Guo,C.M.Reis and G.Thierrin in 1988 is solved in this paper.     

The spectrum of BSA(v, 3, λ; α) with α = 2,3

In this article, a kind of auxiliary design BSA^* for constructing BSAs is introduced and studied. Two powerful recursive constructions on BSAs from 3‐IGDDs and BSA^*s are exploited. Finally, the necessary and sufficient conditions for the existence of a BSA(v, 3, λ; α) with α = 2, 3 are established. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 61–76, 2007     

利用垂直阵列构作Cartesian认证码

利用垂直阵列构作了一类Cartesian认证码,计算了它们的参数,并且在编码规则按等概率分布选取时,成功的模仿攻击和成功的替换攻击概率也被算出。     

格状编码和RS码级连技术在HDTV中应用的性能模拟

设计一种用于ＨＤＴＶ地面数字传输系统的级连格状编码和ＲＳ码方案，并对其在ＨＤＴＶ中应用进行计算机模拟。模拟结果表明：该级连格状编码方案在低信噪比具有较好的误码性能。     

接收机有限带宽对多相码数字脉压的影响

限制接收机带宽是雷达系统中提高信噪比(SNR)的常用方法,相应的也会引起输出波形的失真。本文主要分析了多相码数字脉压雷达系统中,接收机有限带宽对脉压输出结果所造成的影响。运用五点滑动窗平均法在计算机上进行了模拟,并给出了仿真结果。     

关于NF-环的构造

研究了无限的ＮＦ－环及有限的ＮＦ－环，并且给出了有限ＮＦ－环的构造．     

新颖的基于小波变换的数字水印方案

随着计算机网络技术与多媒体技术的快速发展，数字产品的版权保护已经成为信息技术领域中最重要的问题之一，提出了一种新颖的基于离散小波变换的数字水印方案，该方案利用改进的Pacthwork算法，将水印嵌入到LL子带中，水印信号在解码过程中无需使用原始图像可快速地重嵌入，该算法利用BCH码来降低误码率，应用所提出的算法，把一个32个字符的水印嵌入到图像中，实现结果表明水印是不可察觉的，经过JPEG有损压缩，低通与中值滤波等图像处理操作后仍是鲁棒的。     

Deorthogonalization of ODS-CDMA QPSK by AM/PM Nonlinearity

When using a conventional demodulator, a sufficient condition to maintain ODS-CDMA codeword orthogonality is constant relative channel amplitude over the codeword duration. When transmitted over a memoryless, AM/PM nonlinearity channel, the chip-to-chip fluctuating amplitude of a composite ODS-CDMA QPSK waveform produces a chip-to-chip fluctuating phase that deorthogonalizes the ODS-CDMA codewords, resulting in an additional multiple access self-interference similar to that found in asynchronous DS-CDMA. For ODS-CDMA QPSK in an AM/PM nonlinearity channel, we utilize the Central Limit Theorem, derive, and evaluate: (i) an expression for the signal-to-distortion ratio at the demodulator output, (ii) an expression for the uncoded bit error probability, and (iii) an upper bound on the convolutionally-coded bit error probability. We find that the degradation to BER depends on both the AM/PM nonlinearity slope and the ODS-CDMA channel loading.     

Cyclic reduction and FACR methods for piecewise hermite bicubic orthogonal spline collocation

Cyclic reduction and Fourier analysis-cyclic reduction (FACR) methods are presented for the solution of the linear systems which arise when orthogonal spline collocation with piecewise Hermite bicubics is applied to boundary value problems for certain separable partial differential equations on a rectangle. On anN×N uniform partition, the cyclic reduction and Fourier analysis-cyclic reduction methods requireO(N ²log₂ N) andO(N ²log₂log₂ N) arithmetic operations, respectively.