Linear codes over finite fields using greedy algorithms

الملخص EN

In this paper we prove that for any ordered basis B1 of a vector space there is a basis B2 for which the greedy code generated using the B-ordering is linear with respect to B2, where B2 is derived from B1 by a lower triangular matrix P ; B2 = PB1.

In Addition we prove a similar result for self-orthogonal greedy codes.