A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
AbstractIt is well known that cyclic codes are very useful because of their applications, since they are not computationally expensive and encoding can be easily implemented. The relationship between cyclic codes and invariant subspaces is also well known. In this paper a generalization of this relationship is presented between monomial codes over a finite field 𝔽 and hyperinvariant subspaces of 𝔽doi:10.1515/math-2017-0093 fatcat:wbgocwyhtvhydo72kuxqwpmrwe