Turbo码概率-代数联合解码算法

Turbo码采用修正的BAHL et al.算法实现解码.这是一种基于软值的概率迭代解码算法.本文在保持Turbo码迭代软解码算法优点的基础上,充分利用Turbo码编码器结构这一确知条件,结合代数解码原理,提出了一种Turbo码概率-代数联合解码算法.该算法结合了概率解码和代数解码的优点,又有效避免了误差传播的发生,使Turbo码的纠错性能在原经典算法的基础上得到进一步的提高.该算法不仅为降低Turbo码的比特误码率和误差地板值提供了一种新的研究途径,而且因其更好的纠错性能而具有十分明显的实用价值.仿真实验结果显示,在比特误码率(BER)为10^-3~10^-4时,与经典Turbo码解码算法相比,采用该算法能获得0.1dB左右的编码增益.     

线性分组码的神经网络译码

介绍了神经网络与线性分组码之间的关系，并在文献[1]的基础上证明了软判决译码与求解能量函数最大值之间的等价性，然后以(7，4，3)汉明码为例介绍了神经网络在循环码硬判决、软判决译码中的应用。     

等距码的对偶距离分布及其性质

本文主要讨论了等距码的对偶距离分布及其性质，然后利用这些性质将［１］中的某些结果推广到ｑ元等距码情形，并得到了其对偶距离分布的递推关系式，最后，本文给出了ｑ元等距码的码字数目的一个上界。     

Polyadic codes of prime power length

Polyadic codes constitute a special class of cyclic codes and are generalizations of quadratic residue codes, duadic codes, triadic codes, m-adic residue codes and split group codes, which have good error-correcting properties. In this paper, we give necessary and sufficient conditions for the existence of polyadic codes of prime power length. Examples of some good codes arising from the family of polyadic codes of prime power length are also given.     

Scroll codes

We study algebraic geometric codes obtained from rational normal scrolls. We determine the complete weight hierarchy and spectrum of these codes.      

New classes of 2-weight cyclic codes

We introduce new classes of 2-weight cyclic codes which are direct sums of 1-weight irreducible cyclic codes      

BOUNDEDNESS OF FRACTIONAL INTEGRALS IN HARDY SPACES WITH NON-DOUBLING MEASURE - In Memory of Professor Sun Yongsheng

Let μ be a Borel measure on Rd which may be non doubling. The only condition that μ must satisfy is μ(Q) ≤ col(Q)n for any cube Q () Rd with sides parallel to the coordinate axes and for some fixed n with 0 ＜ n ≤ d. The purpose of this paper is to obtain a boundedness property of fractional integrals in Hardy spaces H1 (μ).     

Co-Orthogonal Codes

We define, construct and sketch possible applications of a new class of non-linear codes: co-orthogonal codes, with possible applications in cryptography and parallel processing. We also describe a fast and general method for generating (non-linear) codes with prescribed dot-products with the help of multi-linear polynomials.     

Microstructure array on Si and SiOx generated by micro-contact printing, wet chemical etching and reactive ion etching

A method, combining micro-contact printing (μCP), wet chemical etching and reactive ion etching (RIE), is reported to fabricate microstructures on Si and SiOx. Positive and negative structures were generated based on different stamps used for μCP. The reproducibility of the obtained microstructures shows the methodology reported herein could be useful in Micro-Electro-Mechanical Systems (MEMS), optical and biological sensing applications.     

On the classification of all self-dual additive codes over GF(4) of length up to 12

We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these codes can be represented as graphs, and that two codes are equivalent if and only if the corresponding graphs are equivalent with respect to local complementation and graph isomorphism. We use these facts to classify all codes of length up to 12, where previously only all codes of length up to 9 were known. We also classify all extremal Type II codes of length 14. Finally, we find that the smallest Type I and Type II codes with trivial automorphism group have length 9 and 12, respectively.