Monomial codes seen as invariant subspaces
It 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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2017-08-01
|
| Series: | Open Mathematics |
| Subjects: | |
| Online Access: | http://www.degruyter.com/view/j/math.2017.15.issue-1/math-2017-0093/math-2017-0093.xml?format=INT |
| Summary: | It 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 𝔽n under an appropriate linear transformation. Using techniques of Linear Algebra it is possible to deduce certain properties for this particular type of codes, generalizing known results on cyclic codes. |
|---|---|
| ISSN: | 2391-5455 |