钢笔记下惩罚
发表于 2025-3-30 10:29:47
On the Kronecker Product Construction of Completely Transitive ,-Ary Codes,For any integer . ≥ 1 and for any prime power ., the explicit construction of an infinite family of completely transitive (and completely regular) .-ary codes with minimum distance . = 3 and with covering radius . is given.
娘娘腔
发表于 2025-3-30 14:52:51
http://reply.papertrans.cn/23/2289/228892/228892_52.png
壮观的游行
发表于 2025-3-30 17:25:27
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/228892.jpg
教育学
发表于 2025-3-30 22:03:27
M. Guala,K. T. Christensen,R. J. Adrianof the notion of completely regular codes, given by Delsarte . This problem of existence of such structures is closely related to Delsarte hypothesis about the nonexistence of nontrivial perfect codes in Johnson graphs, the problem of existence of block schemes, the problem of existence of comple
虚度
发表于 2025-3-31 04:00:55
http://reply.papertrans.cn/23/2289/228892/228892_55.png
Affectation
发表于 2025-3-31 08:14:31
http://reply.papertrans.cn/23/2289/228892/228892_56.png
重叠
发表于 2025-3-31 09:37:19
http://reply.papertrans.cn/23/2289/228892/228892_57.png
亲密
发表于 2025-3-31 17:03:27
https://doi.org/10.1007/978-94-011-4930-3esent two results that show different applications of algebraic methods in coding theory. One of them refers to the classical context and another one to the quantum error correcting theory. These results can be found in and respectively, where proofs and more details can be found.
新陈代谢
发表于 2025-3-31 18:33:07
F. Watchorn,G. J. Nichols,D. W. J. Bosenceistortions have upon the Kolmogorov complexity and the clustering by compression technique (the latter based on Normalized Compression Distance, NCD). We show how to decrease the complexity of the considered books introducing several modifications in them. We measure how the information contained in
尊严
发表于 2025-4-1 01:39:15
http://reply.papertrans.cn/23/2289/228892/228892_60.png