小步舞 发表于 2025-3-30 11:35:27
Cyclic Generalized Separable (,) CodesA new class of cyclic generalized separable (., .) codes is constructed.聚集 发表于 2025-3-30 14:10:43
http://reply.papertrans.cn/23/2289/228894/228894_52.pngNibble 发表于 2025-3-30 17:22:20
http://reply.papertrans.cn/23/2289/228894/228894_53.png不断的变动 发表于 2025-3-30 21:11:57
Extending Construction X for Quantum Error-Correcting CodesIn this paper we extend the work of Lisonek and Singh on construction X for quantum error-correcting codes to finite fields of order .. where . is prime. Further, we give some new results on the Hermitian dual of repeated root cyclic codes. These results are used to construct new quantum error-correcting codes.A保存的 发表于 2025-3-31 01:18:42
http://reply.papertrans.cn/23/2289/228894/228894_55.png软膏 发表于 2025-3-31 07:21:13
Sediments and Water Interactions, a few example practical schemes, the best of which attains 0. 82. queries on average. The paper opens two complementary challenges: a systematic analysis of practical schemes so as to identify the best performing ones and design guideline strategies, as well as the need to identify tighter, nontrivial, lower bounds.解决 发表于 2025-3-31 10:31:09
2364-950Xin modern coding theory: codes and combinatorial structures, algebraic geometric codes, group codes, quantum codes, convolutional codes, network coding and cryptography..The book includes a survey paper on the interconnections of coding theory with constrained systems, written by an invited speaker杀子女者 发表于 2025-3-31 16:35:34
http://reply.papertrans.cn/23/2289/228894/228894_58.pngMere仅仅 发表于 2025-3-31 18:31:16
http://reply.papertrans.cn/23/2289/228894/228894_59.png食料 发表于 2025-3-31 22:14:30
The One-Out-of-k Retrieval Problem and Linear Network Coding, a few example practical schemes, the best of which attains 0. 82. queries on average. The paper opens two complementary challenges: a systematic analysis of practical schemes so as to identify the best performing ones and design guideline strategies, as well as the need to identify tighter, nontrivial, lower bounds.