In this paper, we propose a mathematical model for one-dimensional finite linear cellular automata and show connections between our model and the classical one. We then demonstrate, through some examples, that our model is a useful tool for analyzing one-dimensional finite linear cellular automata. We also extend this model to the D-dimensional case and give an algebraic characterization for it.