基于RS编码及网格编码调制的光PPM通信纠错技术

分析了RS(Reed-Solomon)纠错码和网格编码调制（Trellis Coded Modulation,TCM）技术在光脉冲位置调制通信中的应用.在此基础上,提出了以RS码作为外码,以网格编码调制技术作为内码,用于光脉冲位置调制通信的新编码方案,能以几乎不减少通信速率的优势,提高传统RS码系统在时变带限光信道中的通信性能.模拟研究了在不同空间光信道条件下,传统RS码的符号正确传输率和误码率,并对网格编码调制的编码增益、RS码与网格编码调制级联时的编码增益进行了仿真研究,证实了本方案的有效性.     

RS码译码算法对比研究

RS码所具有的高效译码性能使其被广泛应用于数据通信和存储系统的差错控制中。本文主要对目前常用的RS码的硬判决译码算法和K—V代数软判决译码算法进行对比研究。通过对两种算法原理的理论分析,给出了RS码在硬判决与软判决的算法下的计算机仿真。结果表明两种算法均能得到良好的译码效果,而软判决译码算法较硬判决方式能更有效地带来系统增益。而软判决译码算法可以通过适当提高复杂度来改善系统的性能。     

基于故障模式的代码审查方法

基于故障模式的代码审查方法是发现代码中存在的逻辑缺陷、提高软件测试工作效率的有效方法之一。它可以根据成熟的故障模式,对代码逻辑表达的正确性、代码结构和实现的合理性等方面进行有针对性的检查。大量的工程实践表踢。这种方法能够帮助测试人员快速发现代码中存在的缺陷。是提高软件测试工作效率和改进软件质量的有效方法。     

码长连续变化的QC-LDPC码的设计

该文基于有限多项式环的理论,提出了码长连续变化的准循环低密度奇偶校验(Quasi-Cyclic Low Density Parity Check, QC-LDPC)码的设计方法。当有限环基数大于某个门限值时,在此环内通过一定规则选择参数生成移位项,利用它们构造出的校验矩阵均可以达到较大的圈长(girth)值。在设计中,有限环基数为连续的整数,且基数与码长呈线性关系,因此能够在girth值不变的前提下实现码长的连续变化。该文分析并证明了该构造方法大大增加了可用的高性能QC-LDPC码数量,更好地服务于自适应链路系统。     

一种低复杂度的卷积编码CPM的非相干序列检测算法

连续相位调制(CPM)与卷积编码相结合可以进一步提高系统的功率利用率,这使得它在无线通信领域中得到广泛应用.给出了卷积编码CPM的一种低复杂度的非相干序列检测算法,通过正交化处理有效地减少了匹配滤波器个数;在序列检测阶段通过状态融合减少维特比译码的状态数,然后结合判决反馈进行检测.     

二元DNA Hamming码的设计及分析

DNA计算作为一种新的计算模式,有着强大的计算能力。实验表明,有效的编码可以提高DNA计算的可靠性,从而保证DNA计算的成功率。二元Hamming码是一类达到Hamming界的好码,也是仅有的两类完全码中的一类。文中基于纠错码编码理论给出了二元DNA Hamming码的设计过程,并进一步分析了所设计的二元DNA Hamming码的性质及其优点。     

Fast reused code tracing method based on simhash and inverted index

A novel method for fast and accurately tracing reused code was proposed. Based on simhash and inverted in-dex, the method can fast trace similar functions in massive code. First of all, a code database with three-level inverted in-dex structures was constructed. For the function to be traced, similar code blocks could be found quickly according to simhash value of the code block in the function code. Then the potential similar functions could be fast traced using in-verted index. Finally, really similar functions could be identified by comparing jump relationships of similar code blocks. Further, malware samples containing similar functions could be traced. The experimental results show that the method can quickly identify the functions inserted by compilers and the reused functions based on the code database under the premise of high accuracy and recall rate.     

On the Hamming distances of repeated-root constacyclic codes of length 4ps

Let $p$ be an odd prime, $s$, $m$ be positive integers, $\gamma ,\lambda$ be nonzero elements of the finite field ${\mathbb{F}}_{p^m}$ such that ${\gamma }^{p^s}=\lambda$. In this paper, we show that, for any positive integer $\eta$, the Hamming distances of all repeated-root $\lambda$-constacyclic codes of length $\eta p^s$ can be determined by those of certain simple-root $\gamma$-constacyclic codes of length $\eta$. Using this result, Hamming distances of all constacyclic codes of length $4p^s$ are obtained. As an application, we identify all MDS $\lambda$-constacyclic codes of length $4p^s$.     

The dual code of any (δ+αu2)-constacyclic code over F2m[u]∕〈u4〉 of oddly even length

Let ${\mathbb{F}}_{2^m}$ be a finite field of cardinality $2^m$, $R={\mathbb{F}}_{2^m}\left[u\right]∕〈u^4〉={\mathbb{F}}_{2^m}+u{\mathbb{F}}_{2^m}+u^2{\mathbb{F}}_{2^m}+u^3{\mathbb{F}}_{2^m}$ $(u^4=0)$ which is a finite chain ring, and $n$ is an odd positive integer. For any $\delta ,\alpha \in {\mathbb{F}}_{2^m}^{\times }$, an explicit representation for the dual code of any $(\delta +\alpha u^2)$-constacyclic code over $R$ of length $2n$ is given. And some dual codes of $(1+u^2)$-constacyclic codes over $R$ of length 14 are constructed. For the case of $\delta =1$, all distinct self-dual $(1+\alpha u^2)$-constacyclic codes over $R$ of length $2n$ are determined.