全文获取类型
收费全文 | 2584篇 |
免费 | 180篇 |
国内免费 | 34篇 |
专业分类
化学 | 10篇 |
晶体学 | 3篇 |
力学 | 6篇 |
综合类 | 21篇 |
数学 | 822篇 |
物理学 | 209篇 |
无线电 | 1727篇 |
出版年
2024年 | 6篇 |
2023年 | 47篇 |
2022年 | 71篇 |
2021年 | 67篇 |
2020年 | 69篇 |
2019年 | 48篇 |
2018年 | 46篇 |
2017年 | 66篇 |
2016年 | 74篇 |
2015年 | 68篇 |
2014年 | 120篇 |
2013年 | 128篇 |
2012年 | 110篇 |
2011年 | 122篇 |
2010年 | 84篇 |
2009年 | 154篇 |
2008年 | 222篇 |
2007年 | 183篇 |
2006年 | 198篇 |
2005年 | 137篇 |
2004年 | 104篇 |
2003年 | 136篇 |
2002年 | 113篇 |
2001年 | 85篇 |
2000年 | 70篇 |
1999年 | 79篇 |
1998年 | 48篇 |
1997年 | 43篇 |
1996年 | 27篇 |
1995年 | 10篇 |
1994年 | 16篇 |
1993年 | 8篇 |
1992年 | 11篇 |
1991年 | 9篇 |
1990年 | 4篇 |
1989年 | 6篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有2798条查询结果,搜索用时 2 毫秒
131.
《Discrete Mathematics》2018,341(10):2708-2719
132.
Let be an imaginary quadratic field with ring of integers , where is a square free integer such that , and let is a linear code defined over . The level theta function of is defined on the lattice , where is the natural projection. In this paper, we prove that:
i) for any such that , and have the same coefficients up to ,
ii) for , determines the code uniquely,
iii) for , there is a positive dimensional family of symmetrized weight enumerator polynomials corresponding to .
133.
It is known that a projective linear two-weight code C over a finite field corresponds both to a set of points in a projective space over that meets every hyperplane in either a or b points for some integers a < b, and to a strongly regular graph whose vertices may be identified with the codewords of C. Here we extend this classical result to the case of a ring-linear code with exactly two nonzero homogeneous weights and
sets of points in an associated projective ring geometry. We will introduce regular projective two-weight codes over finite
Frobenius rings, we will show that such a code gives rise to a strongly regular graph, and we will give some constructions
of two-weight codes using ring geometries. All these examples yield infinite families of strongly regular graphs with non-trivial
parameters.
相似文献
134.
Yuefei Ma 《Journal of Mathematical Analysis and Applications》2008,340(1):550-557
For given information rate R, it is proved as n tends to infinite, that almost all additive ?n,n⋅R? quantum codes (pure and impure) are the codes with their relative distance tending to h−1(1−R), where is an entropy function. 相似文献
135.
This article improves results of Hamada, Helleseth and Maekawa on minihypers in projective spaces and linear codes meeting the Griesmer bound.In [10,12],it was shown that any
-minihyper, with
, where
, is the disjoint union of
points,
lines,...,
-dimensional subspaces. For q large, we improve on this result by increasing the upper bound on
non-square, to
non-square,
square,
, and (4) for
square, p prime, p<3, to
. In the case q non-square, the conclusion is the same as written above; the minihyper is the disjoint union of subspaces. When q is square however, the minihyper is either the disjoint union of subspaces, or the disjoint union of subspaces and one subgeometry
. For the coding-theoretical problem, our results classify the corresponding
codes meeting the Griesmer bound. 相似文献
136.
We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg
then the state complexity of
is equal to the Wolf bound. For deg
, we use Clifford's theorem to give a simple lower bound on the state complexity of
. We then derive two further lower bounds on the state space dimensions of
in terms of the gonality sequence of
. (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of
and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes. 相似文献
137.
138.
By a T
*(2, k, v)-code we mean a perfect4-deletion-correcting code of length 6 over an alphabet of size v, which is capable of correcting anycombination of up to 4 deletions and/or insertions of letters that occur in transmission of codewords. Thethird author (DCC Vol. 23, No. 1) presented a combinatorial construction for such codes and prove thata T
*(2, 6, v)-code exists for all positive integers v 3 (mod 5), with 12 possible exceptions of v. In this paper, the notion of a directedgroup divisible quasidesign is introduced and used to show that a T
*(2, 6,v)-code exists for all positive integers v 3 (mod 5), except possiblyfor v {173, 178, 203, 208}. The 12 missing cases for T
*(2,6, v)-codes with v 3 (mod 5) are also provided, thereby the existenceproblem for T
*(2, 6, v)-codes is almost complete. 相似文献
139.
The structure of linear codes of constant weight 总被引:1,自引:0,他引:1
Jay A. Wood 《Transactions of the American Mathematical Society》2002,354(3):1007-1026
In this paper we determine completely the structure of linear codes over of constant weight. Namely, we determine exactly which modules underlie linear codes of constant weight, and we describe the coordinate functionals involved. The weight functions considered are: Hamming weight, Lee weight, two forms of Euclidean weight, and pre-homogeneous weights. We prove a general uniqueness theorem for virtual linear codes of constant weight. Existence is settled on a case by case basis.
140.
In this paper we show that the support of the codewords of each type in the Kerdock code of length 2m over Z4 form 3-designs for any odd integer
. In particular, twonew infinite families of 3-designs are obtained in this constructionfor any odd integer
. In particular, twonew infinite families of 3-designs are obtained in this constructionfor any odd integer
, whose parameters are
,and
. 相似文献