Outshine
发表于 2025-3-28 18:28:33
Der Knotenstabzug. Die Einspanngrade ,.al characterization of the weights in the Reed-Muller codes of order 3 as it is to obtain one in the Reed-Muller codes of any orders. We also use this transformation to characterize the existence of some affine sets of bent functions, and to obtain bent functions of degree 4 from bent functions of degree 3.
消瘦
发表于 2025-3-28 20:03:35
https://doi.org/10.1007/BFb0071153e the three following facts:.The dual of the BCH code of length 63 and designed distance 9 has true minimum distance 14 (which was already known)..The BCH code of length 1023 and designed distance 253 has minimum distance 253..The cyclic codes of length 2., 2., 2., with generator polynomial ..(.) and ..(.) have minimum distance 4 (see ).
忧伤
发表于 2025-3-29 00:44:37
The unexpected wildness of randomhod to design .-unidirectional error detecting codes in which the number . of check bits must satisfy the inequality .≤2.−.−1. The encoding and decoding algorithms require time linear in the number . of information bits.
Offensive
发表于 2025-3-29 05:55:13
http://reply.papertrans.cn/31/3007/300622/300622_44.png
BURSA
发表于 2025-3-29 09:27:35
Unidirectional error detecting codes,hod to design .-unidirectional error detecting codes in which the number . of check bits must satisfy the inequality .≤2.−.−1. The encoding and decoding algorithms require time linear in the number . of information bits.
异端邪说2
发表于 2025-3-29 12:50:17
http://reply.papertrans.cn/31/3007/300622/300622_46.png
detach
发表于 2025-3-29 17:07:15
http://reply.papertrans.cn/31/3007/300622/300622_47.png
olfction
发表于 2025-3-29 22:14:04
A note on automorphism groups of codes and symbol error probability computation,rticular both Maximum Likelihood and Unique Coset Leader decoding strategies are investigated when applied to Reed-Solomon codes. Therefore referring to these codes several explicit formulas for the evaluation of the symbol error probability are obtained.
宣誓书
发表于 2025-3-30 02:51:35
http://reply.papertrans.cn/31/3007/300622/300622_49.png
ARY
发表于 2025-3-30 07:37:59
A transformation on boolean functions, its consequences on some problems related to reed-muller cods in a way easy to be followed, and which, when we iterate it, reduces their degrees down to 2 or 3. We deduce that it is as difficult to find a general characterization of the weights in the Reed-Muller codes of order 3 as it is to obtain one in the Reed-Muller codes of any orders. We also use this