We prove that the cyclic and constacyclic codes constructed by Grassl Rötteler in International Symposium on Information Theory (ISIT), pp. 1104–1108 (2015) are generalised Reed–Solomon codes. This note can be considered as an addendum to pp (2015). It also appendix Ball Vilar IEEE Trans Inform 68:3796–3805, (2022) where Conjecture 11 of (2015), which was stated for Grassl–Rötteler codes, is pr...