Grasping
发表于 2025-3-28 17:33:30
http://reply.papertrans.cn/23/2289/228893/228893_41.png
nitric-oxide
发表于 2025-3-28 20:57:00
http://reply.papertrans.cn/23/2289/228893/228893_42.png
大火
发表于 2025-3-29 00:05:54
Annotated and Illustrated Bibliography,is a NP-hard problem for the Hypercube networks. We discuss various cases for .=8, 16, 32. However, for achieving a level of about 50% fault-tolerance for the proposed diagnostic scheme, we provide an optimal solution valid for all Hypercube networks.
FACT
发表于 2025-3-29 06:56:19
http://reply.papertrans.cn/23/2289/228893/228893_44.png
organic-matrix
发表于 2025-3-29 07:52:55
http://reply.papertrans.cn/23/2289/228893/228893_45.png
GRIN
发表于 2025-3-29 12:17:33
http://reply.papertrans.cn/23/2289/228893/228893_46.png
Mercantile
发表于 2025-3-29 18:09:49
http://reply.papertrans.cn/23/2289/228893/228893_47.png
清洗
发表于 2025-3-29 22:32:52
https://doi.org/10.1007/978-94-009-5986-6k codes derived from the optimum one. Some variability of the computation effort being allowed, it is shown that the average decoding complexity can be reduced without too much impairing the performance.
FEAS
发表于 2025-3-30 03:52:58
http://reply.papertrans.cn/23/2289/228893/228893_49.png
Regurgitation
发表于 2025-3-30 07:45:03
Families of codes exceeding the Varshamov-Gilbert bound, Hilbert-class fields, can give better results ; we give here some new lower bounds for A(q) for certain values of q, and we deduce from these some new values of q for which there exists families of codes defined over F., exceeding the Varshamov-Gilbert bound.