移动衰落信道中BICM方案及其与BCM的性能比较

用计算机仿真的方法分析了位交织编码调制(Bit Interleaved Coded Modulation，BICM)的关键技术及其与分组编码调制方案的性能比较．     

高顽存性存储网格的构架与性能分析

为提高海量数据存储的可靠性,结合RS(Reed-Solomon)算法和网格技术提出了高可靠性存储网格的整体构架,设计并实现了RS数据存取中间件,理论上证明了系统的数据存储可靠性。通过性能测试,系统具有极高的读写性能。该系统的实现可很好地解决海量数据存储的可靠性问题。     

Hidden Hypergraphs,Error-Correcting Codes,and Critical Learning in Hopfield Networks

In 1943, McCulloch and Pitts introduced a discrete recurrent neural network as a model for computation in brains. The work inspired breakthroughs such as the first computer design and the theory of finite automata. We focus on learning in Hopfield networks, a special case with symmetric weights and fixed-point attractor dynamics. Specifically, we explore minimum energy flow (MEF) as a scalable convex objective for determining network parameters. We catalog various properties of MEF, such as biological plausibility, and then compare to classical approaches in the theory of learning. Trained Hopfield networks can perform unsupervised clustering and define novel error-correcting coding schemes. They also efficiently find hidden structures (cliques) in graph theory. We extend this known connection from graphs to hypergraphs and discover n-node networks with robust storage of 2Ω(n1−ϵ) memories for any ϵ>0. In the case of graphs, we also determine a critical ratio of training samples at which networks generalize completely.     

Quantum secret sharing based on quantum error-correcting codes

Quantum secret sharing(QSS) is a procedure of sharing classical information or quantum information by using quantum states.This paper presents how to use a [2k-1,1,k] quantum error-correcting code(QECC) to implement a quantum(k,2k 1) threshold scheme.It also takes advantage of classical enhancement of the [2k-1,1,k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously.Because information is encoded into QECC,these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.     

最大熵方法中特征选择算法的改进与纠错排歧

对应用最大熵原理建立语言模型的特征选取方法作了改进.用特征模板从训练样本中获得候选特征集,应用频次与平均互信息相结合的方法从候选特征集中选取特征.在选择有效特征时,对候选特征集中出现频次大于某一限值的特征或平均互信息很大的特征直接加入有效特征集,且不是每选一个特征都调用参数的求解过程,从而加快了特征选择的速度.将改进的算法应用于文本纠错建议的排歧,实验证明,所改进的特征选择算法有效.     

加强的量子汉明限

通过研究具有相同重量的算子集合的性质,找到了任意维数纯量子稳定子码参数的新的解析上限.与目前所知最优的解析上限——著名的量子汉明限相比,本文提出的码限强于量子汉明限. 关键词： 量子汉明限 量子稳定子码 量子纠错码 量子信息     

差错基、量子码与群代数

本文找到了一种研究优质差错基和量子纠错码的新方法,即群代数方法, 它为差错基和量子码提供了一种代数表示. 利用这种代数表示, 建立了一系列关于最一般量子纠错码的线性规划限. 关键词： 群代数 差错基 量子纠错码 量子信息     

Two New Four-Error-Correcting Binary Codes

Two four-error-correcting binary codes of length 21 and 22 and of cardinality 64 and 80, respectively, are constructed. The codes consist of a union of cosets of linear codes with dimension 3 and were found by a maximum clique algorithm.