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

退潮

painkillers

https://doi.org/10.1007/978-94-009-5986-6We describe two methods for computing the minimun polynomial of an element in the finite field GF(q.);both methods have pratically no storage constraint and may improve by a factor 2.6 the classical method.

Vldl379

https://doi.org/10.1007/978-94-009-5986-6In 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.

Glycogen

Annotated and Illustrated Bibliography,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.

opinionated

Codes from some Artin-Schreier curves,Parameters and generator matrices are given for the codes obtained by applying Goppa‘s algebraic-geometric construction method to some Artin-Schreier curves over F. where q = p. for some s∈N. Some results on automorphisms of these codes are given.

招募

New bounds on cyclic codes from algebraic curves,Starting from a deep link between the words of cyclic codes and plane algebraic curves over finite fields we use bounds on the number of rational points of these curves to obtain general bounds for the weights of cyclic codes.

LIMN

A new authentication algorithm,In this work we present a new authentication algorithm with modified versions suitable for identification and signature. It uses error correcting codes and binary field arithmetic. It has the property that counterfeiting attacks are equivalent to solving NP complete problems. It is easy to implement and is economical in computing power and memory.

Cerumen

A method for finding codewords of small weight,We describe a probabilistic algorithm, which can be used to discover words of small weight in a linear binary code. The work-factor of the algorithm is asymptotically quite large but the method can be applied for codes of a medium size. Typical instances that are investigated are codewords of weight 20 in a code of length 300 and dimension 150.

TOXIC

Anthropoid

Note for computing the minimun polynomial of elements in large finite fields,We describe two methods for computing the minimun polynomial of an element in the finite field GF(q.);both methods have pratically no storage constraint and may improve by a factor 2.6 the classical method.