纠错编码中的代数理论与方法

纠错编码是保证通信可靠性的重要手段.本文首先介绍了纠错编码的基本概念和主要数学问题,然后基于线性代数、抽象代数的理论与方法,讨论了两类常见的纠错编码——线性码、循环码.     

需求信息非对称情况下零售商最优订货问题研究

考虑需求信息非对称环境下多个存在竞争的零售商的最优订货问题,每个零售商的需求分布函数未知,传统的通过最大化期望利润来求解最优订货量的方法此时不再适用,转而应用稳健优化中使用的方法-最小化最大后悔值方法.首先给出了零售商最优订货量的一般形式.其次考虑了问题的两种特殊情形:对称博弈、两个零售商的最优订货模型,得到:对称博弈存在Nash平衡点、竞争使得零售商订货量增大、信息不对称使得零售商订货量降低并且零售商的最优订货量在一定条件下会随回收残值的增大而增大;两个零售商最优订货模型下的最优订货量的具体形式.     

R台装置搜索两个坏硬币的一个最优过程

通过对测试集的巧妙选取,给出了用ｒ台装置搜索两个坏硬币的本性理想模型Ｂｒｅ的一个最优测试过程。     

“应召”搜索问题的最优搜索路线

解决了确定性二次搜索（即“应召”搜索）问题的最优搜索路线。在搜索时间期望值最小、最远可能航程最短、最长可能时间最短三个准则下分别找出了相应的最优搜索路线,并从理论上严格证明了三者的统一性。这个结论在军事领域具有很重要的应用价值     

相同装卸工情况下装卸工问题的最优解

装卸工问题是一个新的NP困难的组合最优化问题,寻找其性能优良的近似算法是有重要的理论意义和实用价值的.相同装卸工情况下装卸工问题的系数矩阵是全么模矩阵,利用全么模矩阵的性质可以证明这种情况下的装卸工问题是多项式可解的.然而用全么模阵的性质还不能得到解的表达式.对这种情况下一辆货车的装卸工问题,用对偶单纯形法可得到最优解和最优值的解析表达式,从而可以把这个可解问题的最优值作为一般装卸工问题的近似值.这对于分析近似算法的性态是非常重要的.     

线性系统最优输出转移问题的反馈解

在适当的条件下讨论如何最佳地施加控制将系统的输出转移至目标点,用来度量控制优劣的指标综合反映了转移时间,转移过程所消耗的输入能量与系统自身运动过程所具有的能量的多少,给出了使此指标达到最小的(状态)反馈控制．     

线性系统最优输出转移问题的反馈解

在适当的条件下讨论如何最佳地施加控制将系统的输出转移至目标点,用来度量控制优劣的指标综合反映了转移时间,转移过程所消耗的输入能量与系统自身运动过程所具有的能量的多少,给出了使此指标达到最小的(状态)反馈控制.     

多吉普问题的最优时间

吉普问题是一类与物流运输相关的重要优化模型,目前对吉普问题的关注点主要集中在最远距离问题上,而在实际问题中同样重要的时间效率问题则没有被深入研究.本文考虑多吉普车队如何通过合理调度,使其到达最远距离所需的时间最短的问题.通过引入行驶任务的概念,给出了车队最优时间的表示方式和求解方法.在无仓库数量约束的情况下,得到了达到...     

一道概率统计问题的纠错

在很多参考资料上,有这样一道题目： 把圆周分成四等份,A是其中一个分点,动点Q在四个分点上按逆时针方向前进．现投掷一个质地均匀的正四面体,它的四个面上分别写着1,2,3,4四个数字,Q从A点出发,按照正四面体面上的数字前进几个分点,转一周之前继续投掷．     

基于非对称损失函数指数分布总体的参数设计

田口玄一的参数设计思想只是针对对称的损失函数所做,有一定的局限性.讨论了非对称的损失函数,定义了损失系数比,并在指标服从指数分布的情形下定义了调整参数,并指出了调整参数在参数设计中的特殊位置和重要特性,给出了参数设计的方法和步骤.     

On Lower Bounds for the Redundancy of Optimal Codes

The problem of providing bounds on the redundancy of an optimal code for a discrete memoryless source in terms of the probability distribution of the source, has been extensively studied in the literature. The attention has mainly focused on binary codes for the case when the most or the least likely source letter probabilities are known. In this paper we analyze the relationships among tight lower bounds on the redundancy r. Let r _D,i(x) be the tight lower bound on r for D-ary codes in terms of the value x of the i-th most likely source letter probability. We prove that _D,i-1(x) _D,i(x) for all possible x and i. As a consequence, we can bound the redundancy when only the value of a probability (but not its rank) is known. Another consequence is a shorter and simpler proof of a known bound. We also provide some other properties of tight lower bounds. Finally, we determine an achievable lower bound on r in terms of the least likely source letter probability for D 3, generalizing the known bound for the case D = 2.     

Combinatorial Classification of Optimal Authentication Codes with Arbitration

Unconditionallysecure authentication codes with arbitration ( A ²-codes)protect against deceptions from the transmitter and the receiveras well as that from the opponent. We first show that an optimalA ²-code implies an orthogonal array and an affine-resolvable design. Next we define a new design,an affine -resolvable + BIBD,and prove that optimal A ²-codes are equivalentto this new design. From this equivalence, we derive a conditionon the parameters for the existence of optimal A ²-codes.Further, we show tighter lower bounds on the size of keys thanbefore for large sizes of source states which can be consideredas an extension of the bounds on the related designs.     

Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property

In this paper we discuss the problem of finding optimal prefix-free codes for unequal letter costs, a variation of the classical Huffman coding problem. Our problem consists of finding a minimal cost prefix-free code in which the encoding alphabet consists of unequal cost (length) letters, with lengths α and β. The most efficient algorithm known previously requires O(n^{2 + max(α, β)}) time to construct such a minimal-cost set of n codewords, provided α and β are integers. In this paper we provide an O(n^max(α, β)) time algorithm. Our improvement comes from the use of a more sophisticated modeling of the problem, combined with the observation that the problem possesses a “Monge property” and that the SMAWK algorithm on monotone matrices can therefore be applied.     

Linear Codes with Non-Uniform Error Correction Capability

This paper introduces a class of linear codes which are non-uniform error correcting, i.e. they have the capability of correcting different errors in different code words. A technique for specifying error characteristics in terms of algebraic inequalities, rather than the traditional spheres of radius e, is used. A construction is given for deriving these codes from known linear block codes. This is accomplished by a new method called parity sectioned reduction. In this method, the parity check matrix of a uniform error correcting linear code is reduced by dropping some rows and columns and the error range inequalities are modified.     

q元非线性2-重量码(n,2,ω_1,ω_2)的检错性能

通过定义δ(xi,yi)函数,把2元非线性2-重量码(n,2,ω1,ω2)的性质推广到q元非线性2-重量码(n,2,ω1,ω2)上,根据码的距离分布和对偶距离分布讨论了码C的不可检错概率.给出了码C不是最佳检错码的几个条件.     

A Priori Error Estimates for Obstacle Optimal Control Problem,Where the Obstacle Is the Control Itself

In this paper we deal with the convergence analysis of the finite element method for an elliptic penalized unilateral obstacle optimal control problem where the control and the obstacle coincide. Error estimates are established for both state and control variables. We apply a fixed point type iteration method to solve the discretized problem.To corroborate our error estimations and the efficiency of our algorithms, the convergence results and numerical experiments are illustrated by concrete examples.     

Optimal error bound and Fourier regularization for identifying an unknown source in the heat equation

In this paper we investigate a problem of the identification of an unknown source from one supplementary temperature measurement at a given instant of time for the transient heat equation. Under an a priori condition we answer the question concerning the best possible accuracy for the problem. The Fourier regularization method is utilized for solving the problem, and its convergent rate is analyzed. Numerical results are presented to illustrate the accuracy and efficiency of the method.     

利用有限域上奇异伪辛几何构作具有仲裁的认证码

利用有限域上奇异伪辛几何构作了一个新的具有仲裁的认证码,计算了这个码的参数,当发方编码规则和收方解码规则按等概率分布选取时,计算出各种攻击成功的概率.