Titlebook: Coding Theory and Applications; 3rd International Co Gérard Cohen,Jacques Wolfmann Conference proceedings 1989 Springer-Verlag Berlin Heide

托人看管

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.

遍及

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.

未成熟

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

銼屑

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.

精密

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).

摻假

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

我要威脅

9樓

無法破譯

9樓