9. Commuting Matrices and Hyperinvariant Subspaces

2017 ◽  
Vol 15 (1) ◽  
pp. 1099-1107 ◽  
Author(s):  
María Isabel García-Planas ◽  
Maria Dolors Magret ◽  
Laurence Emilie Um

Abstract 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.


2016 ◽  
Vol 10 (1) ◽  
pp. 27-47 ◽  
Author(s):  
Jeffrey L. Boersema ◽  
Terry A. Loring ◽  
Efren Ruiz

1972 ◽  
Vol 19 (1) ◽  
pp. 1-12 ◽  
Author(s):  
R. G. Douglas ◽  
Carl Pearcy

1972 ◽  
Vol 19 (2) ◽  
pp. 189-191 ◽  
Author(s):  
B. E. Johnson ◽  
A. L. Shields

1971 ◽  
Vol 21 (2) ◽  
pp. 232-235 ◽  
Author(s):  
Allen R. Bernstein
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document