INCUR
发表于 2025-3-23 12:43:52
http://reply.papertrans.cn/16/1526/152557/152557_11.png
弯弯曲曲
发表于 2025-3-23 14:52:14
Blockchain-Plattformen und AbleitungenConstructions of nonbinary linear codes with covering radius . = 2 are considered. Infinite families of linear .-ary codes with . 2, . ≥ 4, and a table of quaternary linear codes with . = 2, redundancy . ≤ 20, are given.
Debility
发表于 2025-3-23 20:11:58
http://reply.papertrans.cn/16/1526/152557/152557_13.png
follicular-unit
发表于 2025-3-23 23:42:20
http://reply.papertrans.cn/16/1526/152557/152557_14.png
archaeology
发表于 2025-3-24 05:23:55
https://doi.org/10.1007/978-3-031-29559-1We present some new lower and upper bounds for the covering radius of codes dual to the product of parity check codes.
讽刺
发表于 2025-3-24 08:25:01
https://doi.org/10.1007/978-3-658-39056-3We consider nonbinary codes with growing length and fixed distance. Linear double-error correcting codes over an arbitrary field . with length . = q. and . ⩽ 2(. + 1) + [./3] check symbols are constructed. Codes with greater distances are also studied.
希望
发表于 2025-3-24 14:39:19
http://reply.papertrans.cn/16/1526/152557/152557_17.png
Dorsal-Kyphosis
发表于 2025-3-24 16:03:27
http://reply.papertrans.cn/16/1526/152557/152557_18.png
dry-eye
发表于 2025-3-24 19:32:06
Our Approach for Cooperative Reasoning,Bounds for the minimum distance and the error probability of decoding for tail biting convolutional codes are presented. We propose a decoding algorithm for these codes and obtain a bound for the asymptotical complexity of almost maximum likelihood decoding.
neutrophils
发表于 2025-3-25 00:11:26
http://reply.papertrans.cn/16/1526/152557/152557_20.png