Learn More
The concept of an error-correcting array gives a new bound on the minimum distance of linear codes and a decoding algorithm which decodes up to half this bound. This gives a unified point of view which explains several improvements on the minimum distance of algebraic-geometric codes. Moreover it is explained in terms of linear algebra and the theory of(More)
The q-ary Reed-Muller codes RM q (u, m) of length n = q m are a generalization of Reed-Solomon codes, which use polynomials in m variables to encode messages through functional encoding. Using an idea of reducing the multivariate case to the uni-variate case, randomized list-decoding algorithms for Reed-Muller codes were given in [1] and [15]. The algorithm(More)
An infinite series of curves is constructed in order to show that all linear codes can be obtained from curves using Goppa's construction. If one imposes conditions on the degree of the divisor used, then we derive criteria for linear codes to be algebraic-geometric. In particular, we investigate the family of q-ary Hamming codes, and prove that only those(More)
Decoding geometric Goppa codes can be reduced to solving the key congruence of a received word in an affine ring. If the code length is smaller than the number of rational points on the curve, then this method can correct up to 1 2 (d * − 1) − s errors, where d * is the designed minimum distance of the code and s is the Clifford defect. The affine ring with(More)
Code-based cryptography is an interesting alternative to classic number-theory PKC since it is conjectured to be secure against quantum computer attacks. Many families of codes have been proposed for these cryptosystems, one of the main requirements is having high performance t-bounded decoding algorithms which in the case of having an error-correcting pair(More)