全文获取类型
收费全文 | 985篇 |
免费 | 43篇 |
国内免费 | 30篇 |
专业分类
化学 | 7篇 |
晶体学 | 3篇 |
力学 | 6篇 |
综合类 | 18篇 |
数学 | 830篇 |
物理学 | 194篇 |
出版年
2024年 | 1篇 |
2023年 | 33篇 |
2022年 | 53篇 |
2021年 | 51篇 |
2020年 | 46篇 |
2019年 | 26篇 |
2018年 | 19篇 |
2017年 | 25篇 |
2016年 | 31篇 |
2015年 | 18篇 |
2014年 | 35篇 |
2013年 | 40篇 |
2012年 | 14篇 |
2011年 | 32篇 |
2010年 | 22篇 |
2009年 | 65篇 |
2008年 | 76篇 |
2007年 | 54篇 |
2006年 | 61篇 |
2005年 | 27篇 |
2004年 | 29篇 |
2003年 | 36篇 |
2002年 | 53篇 |
2001年 | 41篇 |
2000年 | 34篇 |
1999年 | 53篇 |
1998年 | 29篇 |
1997年 | 24篇 |
1996年 | 15篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有1058条查询结果,搜索用时 15 毫秒
51.
Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. So far, most of previous results obtained were for cyclic codes with no more than three nonzeros. Recently, the authors of [37] constructed a class of cyclic codes with arbitrary number of nonzeros, and computed the weight distribution for several cases. In this paper, we determine the weight distribution for a new family of such codes. This is achieved by introducing certain new methods, such as the theory of Jacobi sums over finite fields and subtle treatment of some complicated combinatorial identities. 相似文献
52.
53.
54.
卫星振动对星间光码分多址系统性能的影响 总被引:2,自引:2,他引:0
卫星振动是影响星间光CDMA通信系统性能的一个重要因素.考虑多用户干扰、背景光噪音、热噪音、接收机噪音和卫星振动,给出了基于PPM信号格式的星间二维光CDMA通信系统的系统模型.采用数值分析的方法,详细分析了卫星振动对该系统误码率性能的影响.结果表明,码速率、通信波长和卫星振动都会影响星间二维光CDMA通信系统的误码率性能.当卫星振动标准偏差σ≤4×10-7时,卫星振动对系统误码率性能的影响较小;当卫星振动标准偏差σ≥1.2×10-6,卫星振动对系统误码率性能的影响很大,得到的误码率难以满足系统的通信要求,需要采用卫星振动抑制或补偿等技术提高星间二维光CDMA通信系统的误码率性能. 相似文献
55.
56.
Svitlana Matsenko Oleksiy Borysenko Sandis Spolitis Aleksejs Udalcovs Lilita Gegere Aleksandr Krotov Oskars Ozolins Vjaceslavs Bobrovs 《Entropy (Basel, Switzerland)》2022,24(1)
Forward error correction (FEC) codes combined with high-order modulator formats, i.e., coded modulation (CM), are essential in optical communication networks to achieve highly efficient and reliable communication. The task of providing additional error control in the design of CM systems with high-performance requirements remains urgent. As an additional control of CM systems, we propose to use indivisible error detection codes based on a positional number system. In this work, we evaluated the indivisible code using the average probability method (APM) for the binary symmetric channel (BSC), which has the simplicity, versatility and reliability of the estimate, which is close to reality. The APM allows for evaluation and compares indivisible codes according to parameters of correct transmission, and detectable and undetectable errors. Indivisible codes allow for the end-to-end (E2E) control of the transmission and processing of information in digital systems and design devices with a regular structure and high speed. This study researched a fractal decoder device for additional error control, implemented in field-programmable gate array (FPGA) software with FEC for short-reach optical interconnects with multilevel pulse amplitude (PAM-M) modulated with Gray code mapping. Indivisible codes with natural redundancy require far fewer hardware costs to develop and implement encoding and decoding devices with a sufficiently high error detection efficiency. We achieved a reduction in hardware costs for a fractal decoder by using the fractal property of the indivisible code from 10% to 30% for different n while receiving the reciprocal of the golden ratio. 相似文献
57.
与常规脉冲式主动声呐相比,连续波主动声呐能够提高目标回波的时间处理增益和目标信息更新速率。该文提出一种由正交多相码合成的连续发射波形,分析了发射信号和目标回波模型,设计了多通道匹配滤波器组完成回波检测。为了进一步提高接收机检测性能,提出了多通道非相干积累的处理方法。通过数值仿真,分析提出的连续波形的多普勒分辨性能和目标信息更新率。通过蒙特卡罗法获取接收机工作特性曲线,比较了脉冲式主动声呐和连续波主动声呐在均匀混响背景下对单目标检测性能的差异。仿真结果表明,该文设计的连续波波形具有较好的多普勒分辨性能,在均匀混响背景下,回波检测算法能够明显提高单个目标的探测能力。 相似文献
58.
59.
60.
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. 相似文献