標題: Titlebook: Coding Theory and Design Theory; Part I Coding Theory Dijen Ray-Chaudhuri Conference proceedings 1990 Springer-Verlag New York, Inc. 1990 C [打印本頁] 作者: 萬能 時間: 2025-3-21 20:02
書目名稱Coding Theory and Design Theory影響因子(影響力)
書目名稱Coding Theory and Design Theory影響因子(影響力)學(xué)科排名
書目名稱Coding Theory and Design Theory網(wǎng)絡(luò)公開度
書目名稱Coding Theory and Design Theory網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Coding Theory and Design Theory被引頻次
書目名稱Coding Theory and Design Theory被引頻次學(xué)科排名
書目名稱Coding Theory and Design Theory年度引用
書目名稱Coding Theory and Design Theory年度引用學(xué)科排名
書目名稱Coding Theory and Design Theory讀者反饋
書目名稱Coding Theory and Design Theory讀者反饋學(xué)科排名
作者: Cognizance 時間: 2025-3-21 21:06
J. Allan Feurtado,Allison R. Kermodeexploring further the notions that were introduced in [1]. There we defined the hull, ., of a design . over a finite field ., where . is a prime that divides the order . of the design: if . denotes the code of . over .., defined to be the space spanned by the characteristic functions of the blocks o作者: cipher 時間: 2025-3-22 01:31 作者: 禁令 時間: 2025-3-22 04:42 作者: 脾氣暴躁的人 時間: 2025-3-22 09:03 作者: 終點 時間: 2025-3-22 13:25
Leónie Bentsink,Maarten Koornneefessary and sufficient condition is found to determine when a metric scheme admits a nontrivial perfect multiple covering. Results specific to the classical Hamming and Johnson schemes are given which bear out the relationship between .-designs, orthogonal arrays, and perfect multiple coverings.作者: 終點 時間: 2025-3-22 18:48 作者: 歌唱隊 時間: 2025-3-22 23:18 作者: Precursor 時間: 2025-3-23 05:23
Seed Structure and Composition,ruct . codes. The ideas are based on generalizations of so-called .. The (by now) “classical” Goppa codes (1970, cf.[6]) were already a great improvement on codes known at that time. The algebraic geometric codes were also inspired by ideas of Goppa but the most sensational development was a paper b作者: 袖章 時間: 2025-3-23 07:07 作者: 洞察力 時間: 2025-3-23 11:22 作者: enchant 時間: 2025-3-23 16:08
https://doi.org/10.1007/978-3-030-10504-4cribe the correspondence and discuss various techniques from the algebraic topology of Spin(n) which may be useful in studying self-orthogonal codes. In particular, Quillen’s results in equivariant cohomology theory coupled with some Morse theory may allow one to address certain questions on the min作者: MILL 時間: 2025-3-23 19:07
Fumitaka Abe,Masahiko Mori,Shingo NakamuraLet . be a given .-stage .-sequence over the binary field F., whose minimal polynomial will be denoted by .. We know that . is primitive and of degree .. Denote ., . ≥ 0 and call . the .-th state of the .-stage .-sequence .. Let . be a Boolean polynomial in . variables ..,..., .. and of degree .. Obviously r ≤ n.作者: allergy 時間: 2025-3-24 00:04
Masahiko Otani,Lipeng Zheng,Naoto KawakamiWe prove two theorems which bound the number of pairs of unjoined points in a partial plane ∑ defined on a finite number υ of points. The bounds are obtained under assumptions on the number of lines in ∑ together with the assumption that no line contains more than υ – 3 points.作者: Digest 時間: 2025-3-24 05:40 作者: 分散 時間: 2025-3-24 07:27 作者: Expertise 時間: 2025-3-24 14:11 作者: 消息靈通 時間: 2025-3-24 15:49 作者: 比喻好 時間: 2025-3-24 22:28
Bounds on the Number of Pairs of Unjoined Points in a Partial Plane,We prove two theorems which bound the number of pairs of unjoined points in a partial plane ∑ defined on a finite number υ of points. The bounds are obtained under assumptions on the number of lines in ∑ together with the assumption that no line contains more than υ – 3 points.作者: 手術(shù)刀 時間: 2025-3-25 00:48 作者: LINE 時間: 2025-3-25 06:51
Self-Dual Codes and Self-Dual Designs,We construct self-orthogonal binary codes from projective 2 - (., ., λ) designs with a polarity, . odd, and λ even. We give arithmetic conditions on the parameters of the design to obtain self-dual or doubly even self-dual codes. Non existence results in the latter case are obtained from rationality conditions of certain strongly regular graphs.作者: HUMP 時間: 2025-3-25 09:42
,Some Recent Results on Signed Graphs with Least Eigenvalues ≥ -2,A survey of some results concerning the class of sigraphs represented by root-systems .., n ∈ . and .. is given and some unsolved problems are described.作者: Decline 時間: 2025-3-25 14:24
Coding Theory and Design Theory978-1-4613-8994-1Series ISSN 0940-6573 Series E-ISSN 2198-3224 作者: 閑逛 時間: 2025-3-25 16:41
Steven Footitt,William E. Finch-Savagest a code of codimension 11 and covering radius 2 which has length 64. We conclude with a table which gives the best available information for the length of a code with codimension . and covering radius . for 2 ≤ . ≤ 24 and 2 ≤ . ≤ 24.作者: ineffectual 時間: 2025-3-25 20:52
Leónie Bentsink,Maarten Koornneefessary and sufficient condition is found to determine when a metric scheme admits a nontrivial perfect multiple covering. Results specific to the classical Hamming and Johnson schemes are given which bear out the relationship between .-designs, orthogonal arrays, and perfect multiple coverings.作者: MIRE 時間: 2025-3-26 03:57 作者: Decibel 時間: 2025-3-26 08:03 作者: 分開如此和諧 時間: 2025-3-26 10:37
On the Length of Codes with a Given Covering Radius,st a code of codimension 11 and covering radius 2 which has length 64. We conclude with a table which gives the best available information for the length of a code with codimension . and covering radius . for 2 ≤ . ≤ 24 and 2 ≤ . ≤ 24.作者: Inertia 時間: 2025-3-26 13:46
Perfect Multiple Coverings in Metric Schemes,essary and sufficient condition is found to determine when a metric scheme admits a nontrivial perfect multiple covering. Results specific to the classical Hamming and Johnson schemes are given which bear out the relationship between .-designs, orthogonal arrays, and perfect multiple coverings.作者: shrill 時間: 2025-3-26 17:10 作者: Schlemms-Canal 時間: 2025-3-26 21:03
Self-Orthogonal Codes and the Topology of Spinor Groups,cribe the correspondence and discuss various techniques from the algebraic topology of Spin(n) which may be useful in studying self-orthogonal codes. In particular, Quillen’s results in equivariant cohomology theory coupled with some Morse theory may allow one to address certain questions on the minimum weight of doubly-even self-orthogonal codes.作者: llibretto 時間: 2025-3-27 03:28 作者: 你不公正 時間: 2025-3-27 07:29 作者: 讓步 時間: 2025-3-27 11:13
Baer Subplanes, Ovals and Unitals,exploring further the notions that were introduced in [1]. There we defined the hull, ., of a design . over a finite field ., where . is a prime that divides the order . of the design: if . denotes the code of . over .., defined to be the space spanned by the characteristic functions of the blocks o作者: Boycott 時間: 2025-3-27 15:49
On the Length of Codes with a Given Covering Radius,st a code of codimension 11 and covering radius 2 which has length 64. We conclude with a table which gives the best available information for the length of a code with codimension . and covering radius . for 2 ≤ . ≤ 24 and 2 ≤ . ≤ 24.作者: CBC471 時間: 2025-3-27 21:29 作者: 侵略者 時間: 2025-3-27 22:30 作者: Intrepid 時間: 2025-3-28 02:33
Perfect Multiple Coverings in Metric Schemes,essary and sufficient condition is found to determine when a metric scheme admits a nontrivial perfect multiple covering. Results specific to the classical Hamming and Johnson schemes are given which bear out the relationship between .-designs, orthogonal arrays, and perfect multiple coverings.作者: 構(gòu)想 時間: 2025-3-28 09:22 作者: 辮子帶來幫助 時間: 2025-3-28 10:38 作者: hereditary 時間: 2025-3-28 15:13 作者: 同音 時間: 2025-3-28 19:55 作者: 不感興趣 時間: 2025-3-29 00:14
The Incidence Algebra of a Uniform Poset,d by ., and entries.and . . = . . = 0. The . of . is the real matrix algebra generated by . ., . ., . . (0 ≤ . ≤ .). . is . if there exists real numbers e., e., f., (1 ≤ . ≤ .) (satisfying a certain condition) such that作者: 考博 時間: 2025-3-29 05:06
Self-Orthogonal Codes and the Topology of Spinor Groups,cribe the correspondence and discuss various techniques from the algebraic topology of Spin(n) which may be useful in studying self-orthogonal codes. In particular, Quillen’s results in equivariant cohomology theory coupled with some Morse theory may allow one to address certain questions on the min作者: freight 時間: 2025-3-29 09:50 作者: STELL 時間: 2025-3-29 14:56 作者: Aromatic 時間: 2025-3-29 17:38 作者: 生氣地 時間: 2025-3-29 21:15
Combinatorial Characters of Quasigroups,’ hands, along both Dedekind’s original group determinant approach and Frobenius’ new approach that is now considered part of the theory of association schemes. Shortly afterwards, representation theory methods using matrices took over, and have dominated ever since.作者: 行乞 時間: 2025-3-30 00:48
Urszula Piskurewicz,Luis Lopez-Molinat practical problem is that of channel phase shifts which cause a rotation of every 2-dimensional constituent of a 2.-dimensional signal through the same multiple of 90°. We describe the structure of coset codes and an algebraic method of resolving this phase ambiguity.作者: 人造 時間: 2025-3-30 05:44
Masahiko Otani,Lipeng Zheng,Naoto Kawakamitries. Our preliminary investigations indicate that there are many interesting problems on the loops whose resolution may provide us with a new insight into Sperner Theory, Matroid Theory and Extremal Set Theory.作者: sultry 時間: 2025-3-30 10:53 作者: Pedagogy 時間: 2025-3-30 16:00
The Differential Encoding of Coset Codes by Algebraic Methods,t practical problem is that of channel phase shifts which cause a rotation of every 2-dimensional constituent of a 2.-dimensional signal through the same multiple of 90°. We describe the structure of coset codes and an algebraic method of resolving this phase ambiguity.作者: Obvious 時間: 2025-3-30 20:27 作者: BILE 時間: 2025-3-30 22:13 作者: 留戀 時間: 2025-3-31 01:42 作者: 摘要記錄 時間: 2025-3-31 08:07 作者: squander 時間: 2025-3-31 09:21
Algebraic Geometric Codes, best possible. Actually, the improvement is only achieved for alphabets of size at least 49 and several binary coding experts still have hope that no improvement of the G-V-bound for F. will be possible; (this author is not one of them).作者: Texture 時間: 2025-3-31 14:23 作者: Pcos971 時間: 2025-3-31 20:06 作者: Vldl379 時間: 2025-3-31 23:36
Seed Structure and Composition, best possible. Actually, the improvement is only achieved for alphabets of size at least 49 and several binary coding experts still have hope that no improvement of the G-V-bound for F. will be possible; (this author is not one of them).
