Linear Codes over Finite Fields Based On Greedy Algorithms and Their Applications
Online Islamic University, Department Of Science and Information Technology, Doha, Qatar ramaanadwehh@gmail.com Email:
Abstract
In this paper we prove that for any ordered basis of a vector space there is a basis for which the greedy code generated using the B-ordering is linear with respect to , where B2 is derived from by a lower triangular matrix P; . In Addition we prove a similar result for self-orthogonal greedy codes.
Keywords: greedy algorithm; finite field; linear codes; coding theory