The field of network coding has contributed to the advancement of computer networking, transmission of wireless networks, and more. The subspace metric has recently been a measure of interest for network coding with algorithms being a point of intrigue. This paper will propose encoding and decoding algorithms with the goal that it will provide a foundation for how coding can be done over this metric and provide a path for how to optimize these for the future. The proposed algorithms will be implemented and their results will be presented and analyzed in an attempt to determine the types of algorithms that will be most efficient.
