全文获取类型
收费全文 | 1051篇 |
免费 | 52篇 |
国内免费 | 34篇 |
专业分类
化学 | 7篇 |
晶体学 | 3篇 |
力学 | 6篇 |
综合类 | 29篇 |
数学 | 884篇 |
物理学 | 208篇 |
出版年
2024年 | 2篇 |
2023年 | 35篇 |
2022年 | 44篇 |
2021年 | 52篇 |
2020年 | 48篇 |
2019年 | 27篇 |
2018年 | 19篇 |
2017年 | 26篇 |
2016年 | 32篇 |
2015年 | 19篇 |
2014年 | 39篇 |
2013年 | 45篇 |
2012年 | 14篇 |
2011年 | 32篇 |
2010年 | 23篇 |
2009年 | 70篇 |
2008年 | 79篇 |
2007年 | 62篇 |
2006年 | 68篇 |
2005年 | 31篇 |
2004年 | 35篇 |
2003年 | 38篇 |
2002年 | 61篇 |
2001年 | 42篇 |
2000年 | 35篇 |
1999年 | 57篇 |
1998年 | 36篇 |
1997年 | 27篇 |
1996年 | 16篇 |
1995年 | 5篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1986年 | 2篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有1137条查询结果,搜索用时 15 毫秒
81.
In this paper, we classify all optimal linear[n, n/2] codes up to length 12. We show that thereis a unique optimal [10, 5, 5] code up to equivalence. 相似文献
82.
In this paper, new codes of dimension 8 are presented which give improved bounds on the maximum possible minimum distance of ternary linear codes. These codes belong to the class of quasi-twisted (QT) codes, and have been constructed using a stochastic optimization algorithm, tabu search. Twenty three codes are given which improve or establish the bounds for ternary codes. In addition, a table of upper and lower bounds for d
3(n, 8) is presented for n 200. 相似文献
83.
One of the most important problems of coding theory is to constructcodes with best possible minimum distances. In this paper, we generalize the method introduced by [8] and obtain new codes which improve the best known minimum distance bounds of some linear codes. We have found a new linear ternary code and 8 new linear codes over
with improved minimumdistances. First we introduce a generalized version of Gray map,then we give definition of quasi cyclic codes and introduce nearlyquasi cyclic codes. Next, we give the parameters of new codeswith their generator matrices. Finally, we have included twotables which give Hamming weight enumerators of these new codes. 相似文献
84.
William J. Martin 《Designs, Codes and Cryptography》2000,21(1-3):181-187
A code C F
n is s-regular provided, forevery vertex x F
n, if x is atdistance at most s from C then thenumber of codewords y C at distance ifrom x depends only on i and the distancefrom x to C. If denotesthe covering radius of C and C is -regular,then C is said to be completely regular. SupposeC is a code with minimum distance d,strength t as an orthogonal array, and dual degrees
*. We prove that d 2t + 1 whenC is completely regular (with the exception of binaryrepetition codes). The same bound holds when C is(t + 1)-regular. For unrestricted codes, we show thatd s
* + t unless C is a binary repetitioncode. 相似文献
85.
Long Gui-lu Deng Fu-guo Wang Chuan Li Xi-han Wen Kai Wang Wan-ying 《Frontiers of Physics in China》2007,2(3):251-272
In this review article, we review the recent development of quantum secure direct communication (QSDC) and deterministic secure
quantum communication (DSQC) which both are used to transmit secret message, including the criteria for QSDC, some interesting
QSDC protocols, the DSQC protocols and QSDC network, etc. The difference between these two branches of quantum communication
is that DSQC requires the two parties exchange at least one bit of classical information for reading out the message in each
qubit, and QSDC does not. They are attractive because they are deterministic, in particular, the QSDC protocol is fully quantum
mechanical. With sophisticated quantum technology in the future, the QSDC may become more and more popular. For ensuring the
safety of QSDC with single photons and quantum information sharing of single qubit in a noisy channel, a quantum privacy amplification
protocol has been proposed. It involves very simple CHC operations and reduces the information leakage to a negligible small
level. Moreover, with the one-party quantum error correction, a relation has been established between classical linear codes
and quantum one-party codes, hence it is convenient to transfer many good classical error correction codes to the quantum
world. The one-party quantum error correction codes are especially designed for quantum dense coding and related QSDC protocols
based on dense coding.
相似文献
86.
87.
We give a new exposition and proof of a generalized CSS construction for nonbinary quantum error-correcting codes. Using this we construct nonbinary quantum stabilizer codes with various lengths, dimensions, and minimum distances from algebraic curves. We also give asymptotically good nonbinary quantum codes from a Garcia–Stichtenoth tower of function fields which are constructible in polynomial time. 相似文献
88.
Chi-Kwong Li 《Journal of Mathematical Analysis and Applications》2008,348(2):843-855
For a positive integer k, the rank-k numerical range Λk(A) of an operator A acting on a Hilbert space H of dimension at least k is the set of scalars λ such that PAP=λP for some rank k orthogonal projection P. In this paper, a close connection between low rank perturbation of an operator A and Λk(A) is established. In particular, for 1?r<k it is shown that Λk(A)⊆Λk−r(A+F) for any operator F with rank(F)?r. In quantum computing, this result implies that a quantum channel with a k-dimensional error correcting code under a perturbation of rank at most r will still have a (k−r)-dimensional error correcting code. Moreover, it is shown that if A is normal or if the dimension of A is finite, then Λk(A) can be obtained as the intersection of Λk−r(A+F) for a collection of rank r operators F. Examples are given to show that the result fails if A is a general operator. The closure and the interior of the convex set Λk(A) are completely determined. Analogous results are obtained for Λ∞(A) defined as the set of scalars λ such that PAP=λP for an infinite rank orthogonal projection P. It is shown that Λ∞(A) is the intersection of all Λk(A) for k=1,2,…. If A−μI is not compact for all μ∈C, then the closure and the interior of Λ∞(A) coincide with those of the essential numerical range of A. The situation for the special case when A−μI is compact for some μ∈C is also studied. 相似文献
89.
Most of the literature on coded excitation describes the signal-to-noise ratio gain of a coded waveform in terms of the time-bandwidth product. We have shown that in the context of ultrasound imaging, the expression for the SNR gain provided by matched filtering a coded waveform, can be reduced to the total number of chips in the transmit signal. Hence, the SNR gain is independent of both the bandwidth and the duration of a single-chip. This concept is described in detail, clarifying this seeming contradiction. The impact of bandwidth and pulse duration on the SNR, SNR gain and axial resolution is described. Bandwidth requirements and the impact of regulatory peak-power limitations are also addressed. 相似文献
90.
Shigeto Nishimura 《Discrete Applied Mathematics》2008,156(12):2352-2358
In this contribution the Riemann hypothesis analogue presented by Iwan Duursma is considered. Whether the analogue for a given selfdual code holds depends on its Hamming weight enumerator. A necessary and sufficient condition is provided in the case of genus less than 3 for the homogeneous polynomials in two variables invariant under the MacWilliams transform. Also the case of half integral genus is studied and similar results are obtained. 相似文献