全文获取类型
收费全文 | 1416篇 |
免费 | 68篇 |
国内免费 | 66篇 |
专业分类
化学 | 8篇 |
晶体学 | 3篇 |
力学 | 11篇 |
综合类 | 20篇 |
数学 | 1282篇 |
物理学 | 226篇 |
出版年
2024年 | 2篇 |
2023年 | 41篇 |
2022年 | 63篇 |
2021年 | 59篇 |
2020年 | 59篇 |
2019年 | 44篇 |
2018年 | 30篇 |
2017年 | 34篇 |
2016年 | 40篇 |
2015年 | 31篇 |
2014年 | 56篇 |
2013年 | 88篇 |
2012年 | 27篇 |
2011年 | 53篇 |
2010年 | 37篇 |
2009年 | 93篇 |
2008年 | 108篇 |
2007年 | 81篇 |
2006年 | 93篇 |
2005年 | 46篇 |
2004年 | 44篇 |
2003年 | 54篇 |
2002年 | 72篇 |
2001年 | 55篇 |
2000年 | 50篇 |
1999年 | 63篇 |
1998年 | 44篇 |
1997年 | 37篇 |
1996年 | 21篇 |
1995年 | 6篇 |
1994年 | 2篇 |
1993年 | 5篇 |
1992年 | 5篇 |
1991年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有1550条查询结果,搜索用时 18 毫秒
41.
42.
In Homma M and Kim SJ [2], the authors considered two-point codes on a Hermitian curve defined over fields of odd characteristic.
In this paper, we study the geometry of a Hermitian curve over fields of even characteristic and classify the two-point codes
whose minimum distances agree with the designed ones. 相似文献
43.
We study codes over the p-adic integers and correct errors in the existing literature. We show that MDS codes exist over the p-adics for all lengths, ranks and p. We show that self-dual codes exist over the 2-adics if and only if the length is a multiple of 8 and that self-dual codes
exist over the p-adics with p odd if and only if the length is 0 (mod 4) for p ≡ 3 (mod 4) and 0 (mod 2) for p ≡ 1 (mod 4). 相似文献
44.
Sergey V. Avgustinovich Olof Heden Faina I. Solov’eva 《Designs, Codes and Cryptography》2006,39(3):317-322
The main result is that to any even integer q in the interval 0 ≤ q ≤ 2n+1-2log(n+1), there are two perfect codes C1 and C2 of length n = 2m − 1, m ≥ 4, such that |C1 ∩ C2| = q. 相似文献
45.
Bernhard Krötz 《Japanese Journal of Mathematics》2007,2(2):303-311
In this paper we raise a question about the boundary of the crown domain of a Riemannian symmetric space X. In case X is of Hermitian type we give an affirmative answer. 相似文献
46.
We are interested in improving the Varshamov bound for finite values of length n and minimum distance d. We employ a counting lemma to this end which we find particularly useful in relation to Varshamov graphs. Since a Varshamov
graph consists of components corresponding to low weight vectors in the cosets of a code it is a useful tool when trying to
improve the estimates involved in the Varshamov bound. We consider how the graph can be iteratively constructed and using
our observations are able to achieve a reduction in the over-counting which occurs. This tightens the lower bound for any
choice of parameters n, k, d or q and is not dependent on information such as the weight distribution of a code.
This work is taken from the author’s thesis [10] 相似文献
47.
一类空间分数阶扩散方程经过有限差分离散后所得到的离散线性方程组的系数矩阵是两个对角矩阵与Toeplitz型矩阵的乘积之和.在本文中,对于几乎各向同性的二维或三维空间分数阶扩散方程的离散线性方程组,采用预处理Krylov子空间迭代方法,我们利用其系数矩阵的特殊结构和具体性质构造了一类分块快速正则Hermite分裂预处理子.通过理论分析,我们证明了所对应的预处理矩阵的特征值大部分都聚集于1的附近.数值实验也表明,这类分块快速正则Hermite分裂预处理子可以明显地加快广义极小残量(GMRES)方法和稳定化的双共轭梯度(BiCGSTAB)方法等Krylov子空间迭代方法的收敛速度. 相似文献
48.
In this paper we investigate two-point algebraic-geometry codes (AG codes) coming from the Beelen-Montanucci (BM) maximal curve. We study properties of certain two-point Weierstrass semigroups of the curve and use them for determining a lower bound on the minimum distance of such codes. AG codes with better parameters with respect to comparable two-point codes from the Garcia-Güneri-Stichtenoth (GGS) curve are discovered. 相似文献
49.
We prove two new upper bounds on the size of binary codes with a minimum distance of three, namelyA(10, 3)76 andA(11, 3)152. 相似文献
50.
Ron M. Roth 《Designs, Codes and Cryptography》1996,9(2):177-191
Codes
of length 2
m
over {1, -1} are defined as null spaces of certain submatrices of Hadamard matrices. It is shown that the codewords of
all have an rth order spectral null at zero frequency. Establishing the connection between
and the parity-check matrix of Reed-Muller codes, the minimum distance of
is obtained along with upper bounds on the redundancy of
. An efficient algorithm is presented for encoding unconstrained binary sequences into
. 相似文献