托人看管
发表于 2025-3-30 11:53:59
Polynomial factorization using Brill-Noether algorithm,ther algorithm to the non-irreducible case. We recall that, in coding theory, this algorithm constructs the generator matrices (or the check matrices) of algebraic-geometric Goppa codes associated to absolutely irreducible projective plane curves.
遍及
发表于 2025-3-30 13:24:49
Suboptimum weighted-output symbol-by-symbol decoding of block codes,k codes derived from the optimum one. Some variability of the computation effort being allowed, it is shown that the average decoding complexity can be reduced without too much impairing the performance.
未成熟
发表于 2025-3-30 18:52:39
An overview of recent results in the theory of burst-correcting codes,of interleaving or a technique that considers codes over larger fields. These methods are very popular, partly because of their simplicity. Here a survey of other (recent) methods is given, that because of their combinatorial or algebraic structure have better burst-correcting properties and still have low complexity.
Triglyceride
发表于 2025-3-30 22:26:00
http://reply.papertrans.cn/23/2289/228893/228893_54.png
锉屑
发表于 2025-3-31 02:01:07
Codes and character sums,y BCH (and Goppa) codes we have found good asymptotic results. The nonbinary case is quite different: There is a large gap between the best known upper bounds and the best known lower bounds. It would be desirable to close that gap.
精密
发表于 2025-3-31 07:25:04
Results of generalized minimum distance decoding for block code of rate 1/2,gnal-to-noise ratios, the GMD decoding algorithm enables to achieve MLD performance with a complexity O(n.). We present, by computer simulation, the behavior of the GMD algorithm for different error-correcting codes, in particular, the results for concatenated schemes (Reed-Solomon outer codes with inner convolutional codes).
掺假
发表于 2025-3-31 11:21:21
https://doi.org/10.1007/978-94-009-5986-6gnal-to-noise ratios, the GMD decoding algorithm enables to achieve MLD performance with a complexity O(n.). We present, by computer simulation, the behavior of the GMD algorithm for different error-correcting codes, in particular, the results for concatenated schemes (Reed-Solomon outer codes with inner convolutional codes).
bourgeois
发表于 2025-3-31 17:02:32
http://reply.papertrans.cn/23/2289/228893/228893_58.png
我要威胁
发表于 2025-3-31 18:20:06
9楼
无法破译
发表于 2025-3-31 23:21:03
9楼