清真寺
发表于 2025-3-25 03:48:57
From T(m) triangular graphs to single-error-correcting codes,e C(T(m)) with parameters: n=(m(m−1)(m−2))/2, k=(m(m−1)(m−3)+2)/2, d=3 and A.=A., A. being the number of codewords of weight i in the code..Moreover we give some properties of its codewords set and its orthogonal one. Finally, an alternative method using lattice graphs L. is proposed.
宿醉
发表于 2025-3-25 11:12:17
http://reply.papertrans.cn/16/1591/159054/159054_22.png
Slit-Lamp
发表于 2025-3-25 13:06:24
pplicable ,lgebra, ,rror-,orrecting ,odes, combinatorics and computer algebra,
含沙射影
发表于 2025-3-25 17:36:35
http://reply.papertrans.cn/16/1591/159054/159054_24.png
mendacity
发表于 2025-3-25 23:29:54
A symbolic manipulation system for combinatorial problems,
Corporeal
发表于 2025-3-26 03:16:08
Standard bases and non-noetherianity: Non-commutative polynomial rings,
JIBE
发表于 2025-3-26 05:55:55
The finite fourier-transform as a modular substitution,
利用
发表于 2025-3-26 11:09:52
On computers and modular representations of ,,(,),
cuticle
发表于 2025-3-26 12:57:20
http://reply.papertrans.cn/16/1591/159054/159054_29.png
完成才会征服
发表于 2025-3-26 19:54:49
http://reply.papertrans.cn/16/1591/159054/159054_30.png