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

Genteel

A simple description of Kerdock codes,In reference (1).R.D.Baker gives a convenient characterisation of Preparata codes..We here give a proof of his description and a similar one for Kerdock codes.

易發(fā)怒

Relation between the minimum weight of a linear code over GF(qm) and its q-ary image over GF(q),In this paper we give an upper bound for the minimum distance of the q-ary image of a linear code over GF(q.). This allows us to give some indications about the minimum distance of the q-ary image of MDS codes over GF(q.) when q=2 and q=3.

憤慨點(diǎn)吧

motor-unit

Lecture Notes in Earth Sciencesuse the essential difficulty was that of estimating an exponential sum. It looks possible that in some cases this difficulty could be avoided by relating the demands of (8) and (9) to the estimate given by (10). This approach might lead to elementary proofs and at least it improves some bounds for a

知識(shí)

Swapan Kumar Maity,Ramkrishna Maitithe genus. It has been shown by J.-P. Serre that A(q)≥c logq, where c is a positive constant. His method, based on the existence of infinite towers of Hilbert-class fields, can give better results ; we give here some new lower bounds for A(q) for certain values of q, and we deduce from these some ne

仇恨

ESO

https://doi.org/10.1007/978-3-642-68770-9eds to be entrusted to a postman, which is able to modify (to some extent) the order of delivery of the transmitted letters. In this paper, we give a survey of the results obtained to date in the analysis of this . channel and we suggest several generalizations.

lavish

粗糙濫制

https://doi.org/10.1007/978-94-009-5986-6hibitive complexity, especially for long codes. This paper is intended to study a suboptimum symbol-by-symbol weighted-output decoding process of block codes derived from the optimum one. Some variability of the computation effort being allowed, it is shown that the average decoding complexity can b

Spinal-Tap

https://doi.org/10.1007/978-94-009-5986-6liability of the code symbol is used. We outline relationships between generalized minimum distance and correlation which are two criteria equivalent to Maximum Likelihood Decoding (MLD). A sufficient condition which guarantees the correct result of the GMD decoding algorithm is studied. For high si