This paper explores the framework of quantum error-correcting codes defined by a sequence of measurements, focusing on dynamical codes. The authors introduce the concept of distance for dynamical codes, which is more complex than for static stabilizer codes due to the irreversibility of syndrome information loss. They develop an algorithm to determine the unmasked distance of a dynamical code, which is the minimum distance achievable by considering only the syndrome information obtained through subsequent rounds of measurements. This algorithm helps in analyzing the initialization and masking properties of Floquet codes and provides insights into the limitations of implementing non-Clifford gates in dynamical codes. The paper also discusses the impact of geometric locality on the performance of dynamical codes, showing that limited long-range connectivity can prevent the implementation of non-Clifford gates in 2D settings. The authors conclude by formulating a no-go theorem for non-Clifford transversal gates in 2D geometrically local dynamical codes, highlighting the challenges in extending fault-tolerant analysis to dynamical codes.This paper explores the framework of quantum error-correcting codes defined by a sequence of measurements, focusing on dynamical codes. The authors introduce the concept of distance for dynamical codes, which is more complex than for static stabilizer codes due to the irreversibility of syndrome information loss. They develop an algorithm to determine the unmasked distance of a dynamical code, which is the minimum distance achievable by considering only the syndrome information obtained through subsequent rounds of measurements. This algorithm helps in analyzing the initialization and masking properties of Floquet codes and provides insights into the limitations of implementing non-Clifford gates in dynamical codes. The paper also discusses the impact of geometric locality on the performance of dynamical codes, showing that limited long-range connectivity can prevent the implementation of non-Clifford gates in 2D settings. The authors conclude by formulating a no-go theorem for non-Clifford transversal gates in 2D geometrically local dynamical codes, highlighting the challenges in extending fault-tolerant analysis to dynamical codes.