LINE
发表于 2025-3-25 06:51:36
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:01
,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:54
Coding Theory and Design Theory978-1-4613-8994-1Series ISSN 0940-6573 Series E-ISSN 2198-3224
闲逛
发表于 2025-3-25 16:41:28
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:41
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:08
http://reply.papertrans.cn/23/2289/228896/228896_26.png
Decibel
发表于 2025-3-26 08:03:40
http://reply.papertrans.cn/23/2289/228896/228896_27.png
分开如此和谐
发表于 2025-3-26 10:37:26
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:39
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:52
http://reply.papertrans.cn/23/2289/228896/228896_30.png