首页 | 官方网站   微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 95 毫秒
1.
二元叠加码M_q~c(n,k,d)的性质   总被引:2,自引:2,他引:0  
二元叠加码M_q~c(n,k,d)是二元叠加码M_q(n,k,d)的补阵,利用有限域F_2上向量的计算法则研究了二元叠加码M_q~c(n,k,d)的线性性质并证明了M_q~c(n,k,d)的析取(disjunct)性.  相似文献   

2.
二元叠加码M_q(n,k,d)是一个非适应性分组测试(NGT)算法的数学模型,它是一个d-析取矩阵.将二元叠加码M_q(n,k,d)扩展到M_q(n,k,d,α)并研究了它的性质.  相似文献   

3.
以2002年Ngo Hung Q.和DU Ding-Zhu构作的二元叠加码M_q(n,k,d)为基础生成一个随机Pooling设计,研究了这个随机Pooling设计的参数和性质.  相似文献   

4.
二元矩阵M_q(n,k,d)是一个非适应性分组测试(NGT)算法的数学模型,它是一个d-析取矩阵.在矩阵M_q(n,k,d)的基础上研究它的子矩阵M_q(n.k,d,z)的检纠错性质.  相似文献   

5.
根据二元叠加码(Binary Superimposed Code)M_q(n,k,d)的定义及有限域F_q上n维向量空间的k维子空间的维数性质定义了一个高斯组合函数,利用这个组合函数研究了M_q(n,k,d)码的平均汉明(Hamming)距离和它的均方差问题,给出了计算公式.  相似文献   

6.
d-析取矩阵是非适应性群测(NGT)算法和二元叠加码最有效的数学模型,研究了d-析取矩阵M_q(n,k,d)的扩展码M_q~*(n,k,d)的析取性和容错性.  相似文献   

7.
对于自然数i,d,k,n,0q(i:n,k,d)是一个基于有限域Fq上n维向量空间中子空间的相交关系的二元叠加码,研究了二元叠加码Mq(i:n,k,d)任意列之间的汉明距离,给出了它的检错性和纠错性.  相似文献   

8.
二元码Mq(n,d,k)是一个非适应性分组测试(NGT)算法的数学模型,是一个d-disjunct矩阵.二元码的汉明距离(Hamming)决定着码的检错性和纠错性,通过计算二元码Mq(n,d,k)的汉明距离,得到了它的检错性和纠错性.  相似文献   

9.
首先介绍了一种具有参数d,r的二元叠加(d,n,r)-码及偶特征正交空间上子空间的一些包含性质,然后利用这些性质及相关知识构作了二元叠加(d,n,r)-码并给出了其参数d的界.  相似文献   

10.
利用有限域F_q上n维向量空间中子空间的相交关系定义了一个(0,1)-矩阵M_q(i:n,k,d),它是矩阵M_q(n,k,d)的推广.最后证明了这个矩阵M_q(i:n,k,d)是一个d-析取矩阵并且具有强容错能力.  相似文献   

11.
We discuss relationships in Lindelöf spaces among the properties “Menger”, “Hurewicz”, “Alster”, “productive”, and “D”.  相似文献   

12.
Given a space 〈X,T〉 in an elementary submodel of H(θ), define XM to be XM with the topology generated by . It is established that if XM is compact and satisfies the countable chain condition, while X is not scattered and has cardinality less than the first inaccessible cardinal, then X=XM. If the character of XM is a member of M, then “inaccessible” may be replaced by “1-extendible”.  相似文献   

13.
A dual capacitary Brunn-Minkowski inequality is established for the (n−1)-capacity of radial sums of star bodies in Rn. This inequality is a counterpart to the capacitary Brunn-Minkowski inequality for the p-capacity of Minkowski sums of convex bodies in Rn, 1?p<n, proved by Borell, Colesanti, and Salani. When n?3, the dual capacitary Brunn-Minkowski inequality follows from an inequality of Bandle and Marcus, but here a new proof is given that provides an equality condition. Note that when n=3, the (n−1)-capacity is the classical electrostatic capacity. A proof is also given of both the inequality and a (different) equality condition when n=2. The latter case requires completely different techniques and an understanding of the behavior of surface area (perimeter) under the operation of radial sum. These results can be viewed as showing that in a sense (n−1)-capacity has the same status as volume in that it plays the role of its own dual set function in the Brunn-Minkowski and dual Brunn-Minkowski theories.  相似文献   

14.
15.
The notions of thin and very thin dense subsets of a product space were introduced by the third author, and in this article we also introduce the notion of a slim dense set in a product. We obtain a number of results concerning the existence and non-existence of these types of small dense sets, and we study the relations among them.  相似文献   

16.
关于整(0,m1,…,mq)插值的可解性条件已由刘永平给出,本文给出此插值算子在LP(IR)空间(1≤p<+∞)的饱和阶和饱和类。  相似文献   

17.
Let X be a Banach space and L the generator of the evolution semigroup associated with the τ  -periodic evolutionary process {U(t,s)}ts{U(t,s)}ts on the space Pτ(X)Pτ(X) of all τ-periodic continuous X  -valued functions. We give criteria for the existence of periodic solutions to nonlinear systems of the form Lp=−?F(p,?)Lp=?F(p,?) under the condition that 1 is a normal eigenvalue of the monodromy operator U(τ,0)U(τ,0). The proof is based on a new decomposition of the space Pτ(X)Pτ(X) by constructing a right inverse of L.  相似文献   

18.
19.
20.
In this work we count the number of involutory, unimodal, and alternating elements of the group of signed permutations Bn, and the group of even-signed permutations Dn. Recurrence relations, generating functions, and explicit formulas of the enumerating sequences are given.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号