This article has two purposes. Firstly, the article is devoted to collecting basic facts about the Floquet theorem and various Floquet factorisation algorithms claimed for finite-dimensional linear continuous-time periodic (FDLCP) systems. Secondly, the article presents a unified representation framework for various Floquet factorisations in FDLCP systems, while structural and analytic characteristics about them are examined as well. More precisely, the following aspects are considered: (i) algorithms for Floquet factorisations; (ii) characteristics of Floquet factors; (iii) relationships and properties among Floquet factorisations. Most results are reported for the first time, while the others are generalised versions of existing ones.