$(L,g)$-Codes and Binary Forms

A modification of the definition of $(L,g)$-codes makes it possible to obtain cyclicity and quasicyclicity criteria and to obtain bounds for the number of equivalence classes of a large family of codes. The canonical form of polynomial $g$ is given for codes equivalent to cyclical codes, and also for codes with $\operatorname{deg}g=2,3$.