Evaluation codes from order domain theory

The celebrated Feng–Rao bound estimates 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 matrices. In this paper we derive a simple lower bound on the minimum distance of codes defined by means of their generator matrices. From our bound it is clear how to improve a large family of codes by adding certain rows to their generator matrices. The new bound is very much related to the Feng–Rao bound as well as to Shibuya and Sakaniwa's bound in [T. Shibuya, K. Sakaniwa, A dual of well-behaving type designed minimum distance, IEICE Trans. Fund. E84-A (2001) 647–652]. Our bound is easily extended to deal with any generalized Hamming weights. We interpret our methods into the setting of order domain theory. In this way we fill in an obvious gap in the theory of order domains.