Summary: The notion of shuffle on trajectories is a natural generalization of many word operations considered in the literature. For a set of trajectories \(T\), we define the notion of a \(T\)-code and examine its properties. Particular instances of \(T\)-codes are prefix-, suffix-, infix-, outfix- and hyper-codes, as well as other classes studied in the literature.