全文获取类型
收费全文 | 999篇 |
免费 | 42篇 |
国内免费 | 30篇 |
专业分类
化学 | 7篇 |
晶体学 | 3篇 |
力学 | 6篇 |
综合类 | 18篇 |
数学 | 843篇 |
物理学 | 194篇 |
出版年
2024年 | 1篇 |
2023年 | 34篇 |
2022年 | 52篇 |
2021年 | 53篇 |
2020年 | 49篇 |
2019年 | 32篇 |
2018年 | 22篇 |
2017年 | 25篇 |
2016年 | 33篇 |
2015年 | 19篇 |
2014年 | 36篇 |
2013年 | 40篇 |
2012年 | 14篇 |
2011年 | 32篇 |
2010年 | 22篇 |
2009年 | 64篇 |
2008年 | 75篇 |
2007年 | 54篇 |
2006年 | 61篇 |
2005年 | 26篇 |
2004年 | 29篇 |
2003年 | 36篇 |
2002年 | 53篇 |
2001年 | 41篇 |
2000年 | 33篇 |
1999年 | 53篇 |
1998年 | 29篇 |
1997年 | 24篇 |
1996年 | 15篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有1071条查询结果,搜索用时 15 毫秒
91.
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.
相似文献
92.
93.
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). 相似文献
94.
引进一个关于Goppa几何码(代数几何码)最小距离界的一个新方法.应用Maharaj的思想(即用显示基来近似表达Riemann-Roch空间)到Goppa几何码的最小距离的界上去.通过厄米特曲线上的代数几何码的一类例子,来证明标准的几何码的下界在某些情形下可以被显著地改进.进一步地,我们给出了这些码的最小距离上界,并说明了我们的下界非常接近这个上界. 相似文献
95.
利用有限域上2-幂零矩阵构作Cartesian认证码 总被引:2,自引:0,他引:2
给出 2 -幂零矩阵的Jordan标准型在相似变换下的稳定群的结构 ,利用有限域上 2 -幂零矩阵构作了一个Cartesian认证码 ,计算出了该认证码的参数 .在假定编码规则按等概率分布选取的条件下 ,计算出了该认证码被成功的模仿攻击的最大概率PI 及被成功的替换攻击的最大概率PS. 相似文献
96.
97.
98.
Lars Eirik Danielsen 《Journal of Combinatorial Theory, Series A》2006,113(7):1351-1367
We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these codes can be represented as graphs, and that two codes are equivalent if and only if the corresponding graphs are equivalent with respect to local complementation and graph isomorphism. We use these facts to classify all codes of length up to 12, where previously only all codes of length up to 9 were known. We also classify all extremal Type II codes of length 14. Finally, we find that the smallest Type I and Type II codes with trivial automorphism group have length 9 and 12, respectively. 相似文献
99.
100.
In light of the generator polynomials of constacyclic codes over finite chain rings, the depth spectrum of constacyclic codes can be determined if (n,p)=1. 相似文献