环F_2+vF_2上码的覆盖半径

通过研究环F2+vF2上线性码的结构特征,根据Gray映射,定义了两个二元码,从而证明了环F2+vF2上线性码关于李距离的覆盖半径等于两个二元码的覆盖半径之和,并得到环F2+vF2上对偶码的覆盖半径的一些结论,给出了覆盖半径的几个上下界.     

矩阵张量积与诱导矩阵的y-数值半径

从y-数值半径的定义出发,利用矩阵张量积与诱导矩阵的性质,研究了它们的y-数值半径,得到了矩阵张量积与诱导矩阵y-数值半径的几个不等式.     

Rn空间中单位球面覆盖的半径问题

Banach空间X中的一个闭球族B是X的球覆盖，如果B中的任一元素不包含原点作为其内点，且B中元素之并覆盖了X的单位球面炙．一个球覆盖B称为是极小的当且仅当B的势小于或等于X中所有球覆盖的势．文献[1]证明了在R^n中球覆盖的极小势为n＋1，本文重点利用文献[4]所给出的n维空间中n-单形与其外接超球面间的若干关系，证明了在有限维欧氏空间R^n中极小球覆盖的最小半径为n/2，且当极小球覆盖中（n＋1）个球的球心恰好为球面詈＆的内接正则n-66单形的顶点时可以取到．     

一族Bloch函数的单叶半径与覆盖半径

研究了Bloch函数族B中的一个子族Bg,给出了Bg中函数的单叶半径.作为应用建立了Bg中函数的覆盖定理,从而刻画了Bg中函数的有关性质.     

二维格的覆盖半径

求格的覆盖半径是一个经典的困难问题,当格的维数不固定时,这个问题还没有非确定性的多项式时间的算法.已知的算法都是通过求Voronoi cell来计算覆盖半径,对于二维格,文章利用高斯算法给出了一个确定性的多项式时间的算法来求覆盖半径以及deep holes.     

图的点覆盖数与其Laplace谱半径

本文讨论图的点覆盖数与图的 Laplace谱半径的关系 ,利用特征向量的技巧得到由图的 L aplace谱半径所确定的关于图的点覆盖数的紧的界     

带覆盖需求约束的设施选址问题

带覆盖需求约束的设施选址问题(FLPWCDL)研究:客户必须在规定的响应半径内被服务,并要求服务站能够覆盖规定的需求数量,如何选择合适的服务站,使总成本(建站成本+路线成本)最小.FLPWCDL广泛应用于应急服务、物流、便利店等服务站的选址.建立了问题的混合整数规划模型,并构造了求解FLPWCDL的Benders分解算法,计算实验显示Benders分解算法具有非常高的求解效率与求解质量.     

和垂足三角形有关的几个不等式

本文主要研究了和垂足三角形有关的三角形之间外接圆半径,内切圆半径,旁切圆半径的相关几个不等式．     

绿地喷浇设施的节水构想

为解决公共绿地浇灌的节水问题 ,在圆半径可变的条件下讨论正方形、等腰三角形、一般三角形区域的最优圆覆盖 .对正方形取以其四个顶点和中心点为圆心的五个扇形进行覆盖 ,从而使广阔绿地的有效浇灌率达到 84.88% .对三角形取以其三个顶点为圆心的三个扇形进行覆盖 ,计算出各扇形的最优半径 ,并证明对任意等腰三角形 ,本覆盖法的有效率不小于 82 .70 % .     

两个特殊命题的证明

利用闭区间套定理精确证明幂级数收敛半径的存在性问题．利用有限覆盖定理证明一含参变量积分问题．     

Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers

The multicovering radii of a code are recentgeneralizations of the covering radius of a code. For positivem, the m-covering radius of C is the leastradius t such that everym-tuple of vectors is contained in at least one ball of radiust centered at some codeword. In this paper upper bounds arefound for the multicovering radii of first order Reed-Muller codes. These bounds generalize the well-known Norse bounds for the classicalcovering radii of first order Reed-Muller codes. They are exactin some cases. These bounds are then used to prove the existence of secure families of keystreams against a general class of cryptanalytic attacks. This solves the open question that gave rise to the study ofmulticovering radii of codes.     

The multicovering radius problem for some types of discrete structures

The covering radius problem is a question in coding theory concerned with finding the minimum radius r such that, given a code that is a subset of an underlying metric space, balls of radius r over its code words cover the entire metric space. Klapper (IEEE Trans. Inform. Theory 43:1372–1377, 1997) introduced a code parameter, called the multicovering radius, which is a generalization of the covering radius. In this paper, we introduce an analogue of the multicovering radius for permutation codes (Des. Codes Cryptogr. 41:79–86, cf. 2006) and for codes of perfect matchings (cf. 2012). We apply probabilistic tools to give some lower bounds on the multicovering radii of these codes. In the process of obtaining these results, we also correct an error in the proof of the lower bound of the covering radius that appeared in (Des. Codes Cryptogr. 41:79–86, cf. 2006). We conclude with a discussion of the multicovering radius problem in an even more general context, which offers room for further research.     

On the Covering Radius of Ternary Extremal Self-Dual Codes

In this paper, we investigate the covering radius of ternary extremal self-dual codes. The covering radii of all ternary extremal self-dual codes of lengths up to 20 were previously known. The complete coset weight distributions of the two inequivalent extremal self-dual codes of length 24 are determined. As a consequence, it is shown that every extremal ternary self-dual code of length up to 24 has covering radius which meets the Delsarte bound. The first example of a ternary extremal self-dual code with covering radius which does not meet the Delsarte bound is also found. It is worth mentioning that the found code is of length 32.     

On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes

We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tietäväinen lt:newu and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The upper bound on the information rate is an application of a shortening method of a code and is an analogue of the Shannon-Gallager-Berlekamp straight line bound on error probability. These results improve on the best presently known asymptotic upper bounds on minimum distance and covering radius of non-binary codes in certain intervals.     

卡氏积码的r-MDR码与P_r-MDS码

本文研究了卡氏积码的r-广义Hamming重量计算公式和广义Singleton界,利用r-卡氏积码的子码仍为卡氏积码,证明了r-MDR码或Pr-MDR码的卡氏积码仍为r-MDR码或Pr-MDR码.同时也给出了这一个结果的部分逆命题.     

Self-dual Co des with Symplectic Inner Pro duct

In this paper, we discuss a kind of Hermitian inner product — symplectic inner product, which is different from the original inner product — Euclidean inner product. According to the definition of symplectic inner product, the codes under the symplectic inner product have better properties than those under the general Hermitian inner product. Here we present the necessary and sufficient condition for judging whether a linear code C over Fp with a generator matrix in the standard form is a symplectic self-dual code. In addition, we give a method for constructing a new symplectic self-dual codes over Fp, which is simpler than others.     

Structure Theorems for Group Ring Codes with an Application to Self-Dual Codes

Using ideas from the cohomology of finite groups, an isomorphism is established between a group ring and the direct sum of twisted group rings. This gives a decomposition of a group ring code into twisted group ring codes. In the abelian case the twisted group ring codes are (multi-dimensional) constacyclic codes. We use the decomposition to prove that, with respect to the Euclidean inner product, there are no self-dual group ring codes when the group is the direct product of a 2-group and a group of odd order, and the ring is a field of odd characteristic or a certain modular ring. In particular, there are no self-dual abelian codes over the rings indicated. Extensions of these results to non-Euclidean inner products are briefly discussed.     

On maximal Spherical codes II

We consider spherical codes attaining the Levenshtein upper bounds on the cardinality of codes with prescribed maximal inner product. We prove that the even Levenshtein bounds can be attained only by codes which are tight spherical designs. For every fixed n ≥ 5, there exist only a finite number of codes attaining the odd bounds. We derive different expressions for the distance distribution of a maximal code. As a by-product, we obtain a result about its inner products. We describe the parameters of those codes meeting the third Levenshtein bound, which have a regular simplex as a derived code. Finally, we discuss a connection between the maximal codes attaining the third bound and strongly regular graphs. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 316–326, 1999     

关于外积码的Hamming谱

本文研究了任意有限域Fq上的两个线性码的外积及其有关性质；并给出了由两个线性码构造的外积码的Hamming谱的第1个谱值的界以及最后一个谱值。