助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   if and only if 在 电信技术 分类中 的翻译结果: 查询用时:0.012秒
图标索引 在分类学科中查询
所有学科
电信技术
数学
逻辑学
更多类别查询

图标索引 历史查询
 

if and only if
    很抱歉,暂未找到该词条在当前类别下的译词。您可以查看在所有学科下的译词。
相关语句
  “if and only if”译为未确定词的双语例句
    To a (n, k, t) RS code, when v, the number of the errorsymbol in its received words r(x), is equal to t, rn-1 must be an inaccurate symbol if and only if det(Njt+1) = 0 and nonzero element B = det(Njt)/det(Mjt-1) exist.
    对于一个(n,k,t)RS码,其接收码字,r(x)中错误符号的个数v=t时,仅当非零元素β=det(N_t~j)/det(M_(t-1)~j)存在以及det(N′_(t+1)~j)=0时,符号r_(n-j)才是一个错误的符号。
短句来源
    U sing the formula obtained,it is show that if the frequency response H(ω) is continuous and the set H 0 of zeros of H(ω) and the set Γ x of jump points of F x(ω) do not intersect each other,then t he output spectral function F x(ω) is a pure jump function on [-π, π] if and only if so the input spectral function F x(ω) is.
    利用所得公式 ,在系统的频率响应 H( ω)连续且它的零点集 H0 与输入序列谱函数 Fx( ω)的跳跃点集 Γx 适合 Γx∩ H0 =的条件下 ,证明了输出序列谱函数Fy( ω)为 [- π,π]上的纯跳跃函数的充要条件是 Fx( ω)亦为 [- π,π]上的纯跳跃函数。
短句来源
    SetP(xo,XI,...,Xd1) =xdI+r(XO,xl ,...,xd2), then the compression mappingis injectiveness, that is, a=b if and only if p(ao,a,...,adI) =p(bo,bl,...,bdI) for a, beG(f(x)).
    (a_0,a_1,…,a_(d-1))=(?) (b_0,b_1,…,b_(d-1))。
短句来源
    Under the condition of nondegenerate linear transformation, a partially-bent function f(x) on V_n satisfies the SAC if and only if there exists a vector a∈ V_n such that △_f(a) = 0. Under the condition of |R| > 2, we present an upper bound of the degree of partially-bent functions satisfy the propagation criteria.
    在|R|>2的条件下,给出了部分Bent函数满足扩散准则次数的上界。
短句来源
    By doing so the candidate pulses for replacement are greatly reduced in the sense that pulses in LPMG (Low Probability Member Group) in each track will be tested for replacement if and ONLY if there's NO pulse in HPMG (High Probability Member Group) meeting the algorithm demand.
    初始化后,通过计算当前固定码本中每个脉冲的负面贡献值来对当前码本进行脉冲替换。 而在每个脉轨里随后进行的脉冲替换时,算法将始终遵循这样的原则:只有在没有一个高概率成员组合中的脉冲满足要求时才去测试低概率成员组合中的脉冲,从而脉冲替换时的备选脉冲个数相应地减少了,使得算法搜索复杂度大大降低。
短句来源
更多       
查询“if and only if”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  if and only if
This implies that a system is algebraically integrable (i.e., its eigenvalue problem is explicitly solvable in quadratures) if and only if the differential Galois group is commutative for generic eigenvalues.
      
TheS-arithmetic group г is of typeFn, resp.FPn, if and only if for allp inS thep-adic completionGp of the corresponding algebraic groupG is of typeCn resp.CPn.
      
We show that in the modular case, the ring of invariants in is of this form if and only if is a polynomial algebra and all pseudoreflections in ?(G) are diagonalizable.
      
Specifically, a subset is complete if and only if it contains infinitely many even-order autocorrelation functions.
      
We next show that this result is best possible by including a result of Kalton: A frame can be represented as a linear combination of two orthonormal bases if and only if it is a Riesz basis.
      
更多          


Let Cp(x) denote the cyclic code generated by p(X), and Cpn(x) the principal ideal generated by p(X) in the algebra of polynomials modulo Xn - 1. The following theorems may make clear the idea behind the design of Fire codes.Theorem Ⅰ. If n is the length of Cp(x)q(x), and p(X) is relatively prime to q(X), then Cp(X)q(x) is equal to the intersection Cpn(x)Cqn(x).Theorem Ⅱ. Consider three cyclic codes with the intersection of the first two equal to the third. The syndromes of the two distinct bursts with respect...

Let Cp(x) denote the cyclic code generated by p(X), and Cpn(x) the principal ideal generated by p(X) in the algebra of polynomials modulo Xn - 1. The following theorems may make clear the idea behind the design of Fire codes.Theorem Ⅰ. If n is the length of Cp(x)q(x), and p(X) is relatively prime to q(X), then Cp(X)q(x) is equal to the intersection Cpn(x)Cqn(x).Theorem Ⅱ. Consider three cyclic codes with the intersection of the first two equal to the third. The syndromes of the two distinct bursts with respect to the first or second code are not the same if and only if the syndromes with respect to the third are not the same.

文中运用循环码求交运算的方法,对纠突发错误循环码的设计思想作了一些探讨,给出了Fire码的一种纠突发错误算法。

In this paper,we have defined a kind of finite groups.The group G is regarded as “*” group,if and only if |μ(G)|=|π(G)|.We have obtained the properties of “*” group and have given the basic structure of “*” group just in case group G is solvable or supersolvable.

本文讨论了一类有限群,当且仅当|μ(G)|=|π(G)|,我们称该群 G 为“*”群。我们得到了“*”群的一系列性质,并给出了在群 G 可解或超可解情形下“*”群的基本构造。

Automatic repeat request (ARQ) schemes have been widely applied to many digital communication systems,especially,computer communication networks. Because the undetected error probability of block codes is a key parameter determining the performance of ARQ systems.it is important to deal with the undetected error probability of a variety of linear block codes. A linear block code, of q-al system whose undetected error probability satisfies the upper bound q-(m-k), is defined as a good code for error detection....

Automatic repeat request (ARQ) schemes have been widely applied to many digital communication systems,especially,computer communication networks. Because the undetected error probability of block codes is a key parameter determining the performance of ARQ systems.it is important to deal with the undetected error probability of a variety of linear block codes. A linear block code, of q-al system whose undetected error probability satisfies the upper bound q-(m-k), is defined as a good code for error detection. A dual theorem on error detection codes is shown,that is ,a (n,k) linear block code in GF(q) is the good code for error detection if and only if its dual code (n,n - k) is also a good one. Therefore,the error detection capability of linear block codes can be known through their dual codes. A series of new results on error detection codes are obtained with the help of the dual theorem.

自动请求重传(ARQ)方法已经在许多数字通信系统特别是通信网中获得了广泛的应用。在ARQ系统中,分组码的不可检错误概率是决定系统性能的重要参数,因此研究各种线性分组码的不可检错误概率显得非常重要。在本文中,不可检错误概率满足上限q~(-(m-k))的q进制线性分组码被定义为检错好码。笔者证明了关于检错码的一个对偶定理,即GF(q)上(n,k)线性分组码为检错好码的充要条件是其对偶码也是检错好码。对偶定理表明,可以从一个线性分组码的对偶码研究它的检错能力,本文用这个定理得到了关于检错码的一系列新的结论。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关if and only if的内容
在知识搜索中查有关if and only if的内容
在数字搜索中查有关if and only if的内容
在概念知识元中查有关if and only if的内容
在学术趋势中查有关if and only if的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社