Document(s)

Title

The Feng-Rao bound gives a lower bound on the minimum distance of codes defined by means of their parity check matrices. From the Feng-Rao bound it is clear how to improve a large family of codes by leaving out certain rows in their parity check matr...

The Feng-Rao bound gives good estimates of the minimum distance of a large class of codes. In this work we are concerned with the problem of how to extend the Feng-Rao bound so that it deals with all the generalized Hamming weights. The problem was s...

Udgivelsesdato: JUL

The notion of an order domain is generalized. The behaviour of an order domain by taking a subalgebra, the extension of scalars, and the tensor product is studied. The relation of an order domain with valuation theory, Gröbner algebras, and graded st...

Udgivelsesdato: JUL