Linearity of greedy codes over Zp

الملخص EN

In this paper we prove that for any ordered basis Bj 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 2ج is derr / ed from Bj by a lower triangular matrix p؛ B2 ء PBi.

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