In 1987, Gelfand and Serganova introduced Coxeter matroids. The type-A Coxeter matroid recovers the definition of matroids that we know and love. In this talk, we'll look at the type-C Coxeter matroid and its relation to the type-A matroid. In the type-A case, one of the notable (and very useful!) properties of matroids is their collection of cryptomorphic definitions. Interestingly, though type-C versions of the cryptomorphic definitions have been conjectured, proving their equivalence continues to be a work-in-progress.