This paper addresses the problem of error-control in random linear network coding, focusing on a "noncoherent" or "channel oblivious" model where neither the transmitter nor the receiver has knowledge of the channel transfer characteristics. The authors introduce a metric on the projective geometry associated with the packet space and show that a minimum distance decoder achieves correct decoding if the dimension of the intersection of the transmitted and received spaces is sufficiently large. They also derive sphere-packing and sphere-covering bounds, as well as a generalized Singleton bound for such codes. Additionally, they describe a Reed-Solomon-like code construction related to Gabidulin's construction of maximum rank-distance codes and provide a Sudan-style "list-1" minimum distance decoding algorithm. The paper is structured into sections covering operator channels, coding for operator channels, bounds on codes, and a Reed-Solomon-like code construction and decoding algorithm.This paper addresses the problem of error-control in random linear network coding, focusing on a "noncoherent" or "channel oblivious" model where neither the transmitter nor the receiver has knowledge of the channel transfer characteristics. The authors introduce a metric on the projective geometry associated with the packet space and show that a minimum distance decoder achieves correct decoding if the dimension of the intersection of the transmitted and received spaces is sufficiently large. They also derive sphere-packing and sphere-covering bounds, as well as a generalized Singleton bound for such codes. Additionally, they describe a Reed-Solomon-like code construction related to Gabidulin's construction of maximum rank-distance codes and provide a Sudan-style "list-1" minimum distance decoding algorithm. The paper is structured into sections covering operator channels, coding for operator channels, bounds on codes, and a Reed-Solomon-like code construction and decoding algorithm.