全文获取类型
收费全文 | 1178篇 |
免费 | 122篇 |
国内免费 | 51篇 |
专业分类
化学 | 8篇 |
晶体学 | 3篇 |
力学 | 41篇 |
综合类 | 22篇 |
数学 | 1008篇 |
物理学 | 269篇 |
出版年
2024年 | 2篇 |
2023年 | 35篇 |
2022年 | 53篇 |
2021年 | 57篇 |
2020年 | 55篇 |
2019年 | 31篇 |
2018年 | 24篇 |
2017年 | 41篇 |
2016年 | 46篇 |
2015年 | 24篇 |
2014年 | 65篇 |
2013年 | 71篇 |
2012年 | 28篇 |
2011年 | 53篇 |
2010年 | 49篇 |
2009年 | 82篇 |
2008年 | 90篇 |
2007年 | 64篇 |
2006年 | 70篇 |
2005年 | 35篇 |
2004年 | 37篇 |
2003年 | 42篇 |
2002年 | 61篇 |
2001年 | 41篇 |
2000年 | 37篇 |
1999年 | 60篇 |
1998年 | 29篇 |
1997年 | 26篇 |
1996年 | 15篇 |
1995年 | 6篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1988年 | 1篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有1351条查询结果,搜索用时 31 毫秒
101.
P. Seneviratne 《Discrete Mathematics》2009,309(8):1967-3119
Partial permutation decoding is shown to apply to the first-order Reed-Muller codes R(1,m), where m>4 by finding s-PD-sets for these codes for 2≤s≤4. 相似文献
102.
With the emergence of wireless networks, cooperation for secrecy is recognized as an attractive way to establish secure communications. Departing from cryptographic techniques, secrecy can be provided by exploiting the wireless channel characteristics; that is, some error-correcting codes besides reliability have been shown to achieve information-theoretic security. In this paper, we propose a polar-coding-based technique for the primitive relay wiretap channel and show that this technique is suitable to provide information-theoretic security. Specifically, we integrate at the relay an additional functionality, which allows it to smartly decide whether it will cooperate or not based on the decoding detector result. In the case of cooperation, the relay operates in a decode-and-forward mode and assists the communication by transmitting a complementary message to the destination in order to correctly decode the initial source’s message. Otherwise, the communication is completed with direct transmission from source to the destination. Finally, we first prove that the proposed encoding scheme achieves weak secrecy, then, in order to overcome the obstacle of misaligned bits, we implement a double-chaining construction, which achieves strong secrecy. 相似文献
103.
Anton Skidin Alexey Redyuk Olga Shtyrina Michael Fedoruk Alex Shafarenko 《Optics Communications》2011,284(19):4695-4698
We quantify the error statistics and patterning effects in a 5 × 40 Gbit/s WDM RZ-OOK SMF/DCF fibre link using hybrid Raman/EDFA amplification. By extensive use of a numerical model, we determine how the error statistics change with the transmission distance. This knowledge is used as a basis for a constrained coding technique in order to improve the transmission error rate. We propose an adaptive constrained code for mitigation of the patterning effects and demonstrate that this approach can substantially reduce the bit error rate (BER) even for very large values of the channel BER (BER > 10− 1). The proposed technique can be used in combination with forward error correction schemes (FEC) to extend the range of channel BERs that an FEC scheme is effective over. 相似文献
104.
The stabilizer (additive) method and non-additive method for constructing asymmetric quantum codes have been established. In this paper, these methods are gen- eralized to inhomogeneous quantum codes. 相似文献
105.
In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m + uFp^m, where p is an odd prime. On the basis of the works of Dinh (in J.Algebra 324,940-950,2010), we use the Chinese Remainder Theorem to establish the algebraic structure of cyclic and negacyclic codes of length 2p^s over the ring Fp^m + uFp^m in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes. 相似文献
107.
Steiner quadruple systems are set systems in which every triple is contained in a unique quadruple. It is well known that Steiner quadruple systems of order v, or SQS(v), exist if and only if . Universal cycles, introduced by Chung, Diaconis, and Graham in 1992, are a type of cyclic Gray code. Overlap cycles are generalizations of universal cycles that were introduced in 2010 by Godbole, et al. Using Hanani's SQS constructions, we show that for every with there exists an SQS(v) that admits a 1‐overlap cycle. 相似文献
108.
Let q be an odd prime power and let be the minimum size of the symmetric difference of r lines in the Desarguesian projective plane . We prove some results about the function , in particular showing that there exists a constant such that for . 相似文献
109.