scholarly journals Monomial codes seen as invariant subspaces

2017 ◽  
Vol 15 (1) ◽  
pp. 1099-1107 ◽  
Author(s):  
María Isabel García-Planas ◽  
Maria Dolors Magret ◽  
Laurence Emilie Um
Keyword(s):  
Finite Field ◽  
Linear Algebra ◽  
Linear Transformation ◽  
Cyclic Codes ◽  
Invariant Subspaces ◽  
Hyperinvariant Subspaces ◽  
Computationally Expensive ◽  
The Relationship

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.

A Lattice-Theoretic Description of the Lattice of Hyperinvariant Subspaces of a Linear Transformation

1976 ◽  
Vol 28 (5) ◽  
pp. 1062-1066 ◽  
Author(s):  
W. E. Longstaff
Keyword(s):  
Hilbert Space ◽  
Partial Order ◽  
Linear Transformation ◽  
Complete Lattice ◽  
Lattice Structure ◽  
Invariant Subspaces ◽  
Complex Hilbert Space ◽  
The Family ◽  
Hyperinvariant Subspaces ◽  
Theoretic Description

If A is a (linear) transformation acting on a (finitedimensional, non-zero, complex) Hilbert space H the family of (linear) subspaces of H which are invariant under A is denoted by Lat A. The family of subspaces of H which are invariant under every transformation commuting with A is denoted by Hyperlat A. Since A commutes with itself we have Hyperlat A ⊆ Lat A. Set-theoretic inclusion is an obvious partial order on both these families of subspaces. With this partial order each is a complete lattice; joins being (linear) spans and meets being set-theoretic intersections. Also, each has H as greatest element and the zero subspace (0) as least element. With this lattice structure being understood, Lat A (respectively Hyperlat A) is called the lattice of invariant (respectively, hyper invariant) subspaces of A.

scholarly journals Closed sets of finitary functions between finite fields of coprime order

2020 ◽  
Vol 81 (4) ◽  
Author(s):  
Stefano Fioravanti
Keyword(s):  
Finite Field ◽  
Vector Space ◽  
Finite Fields ◽  
Linear Transformation ◽  
Minimal Polynomial ◽  
Invariant Subspaces ◽  
Closed Sets ◽  
The Right ◽  
Coprime Order

AbstractWe investigate the finitary functions from a finite field $$\mathbb {F}_q$$ F q to the finite field $$\mathbb {F}_p$$ F p , where p and q are powers of different primes. An $$(\mathbb {F}_p,\mathbb {F}_q)$$ ( F p , F q ) -linearly closed clonoid is a subset of these functions which is closed under composition from the right and from the left with linear mappings. We give a characterization of these subsets of functions through the invariant subspaces of the vector space $$\mathbb {F}_p^{\mathbb {F}_q\backslash \{0\}}$$ F p F q \ { 0 } with respect to a certain linear transformation with minimal polynomial $$x^{q-1} - 1$$ x q - 1 - 1 . Furthermore we prove that each of these subsets of functions is generated by one unary function.

Hodge Representations and Hodge Domains

2012 ◽  
Author(s):  
Mark Green ◽  
Phillip Griffiths ◽  
Matt Kerr
Keyword(s):  
Linear Algebra ◽  
Algebraic Groups ◽  
Adjoint Representation ◽  
Structure Theory ◽  
Classical Groups ◽  
Hodge Structures ◽  
Standard Material ◽  
Exceptional Groups ◽  
The Relationship

This chapter deals with Hodge representations and Hodge domains. For general polarized Hodge structures, it considers which semi-simple ℚ-algebraic groups M can be Mumford-Tate groups of polarized Hodge structures, the different realizations of M as a Mumford-Tate group, and the relationship among the corresponding Mumford-Tate domains. The chapter uses standard material from the structure theory of semisimple Lie algebras and their representation theory. The discussion covers the adjoint representation and characterization of which weights give faithful Hodge representations, the classical groups and the exceptional groups, and Mumford-Tate domains as particular homogeneous complex manifolds. The examples concerning the classical groups illustrate both the linear algebra and Vogan diagram methods.

scholarly journals Ordinary K3 surfaces over a finite field

2020 ◽  
Vol 2020 (761) ◽  
pp. 141-161
Author(s):  
Lenny Taelman
Keyword(s):  
Finite Field ◽  
Linear Algebra ◽  
Abelian Varieties ◽  
K3 Surfaces ◽  
Small Degree ◽  
Stable Reduction

AbstractWe give a description of the category of ordinary K3 surfaces over a finite field in terms of linear algebra data over {{\mathbf{Z}}}. This gives an analogue for K3 surfaces of Deligne’s description of the category of ordinary abelian varieties over a finite field, and refines earlier work by N.O. Nygaard and J.-D. Yu. Our main result is conditional on a conjecture on potential semi-stable reduction of K3 surfaces over p-adic fields. We give unconditional versions for K3 surfaces of large Picard rank and for K3 surfaces of small degree.

scholarly journals Primitive Idempotents of Irreducible Cyclic Codes of Length n

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Yuqian Lin ◽  
Qin Yue ◽  
Yansheng Wu
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Matrix Method ◽  
Cyclic Codes ◽  
Prime Divisors ◽  
Primitive Idempotents ◽  
Irreducible Cyclic Codes

Let Fq be a finite field with q elements and n a positive integer. In this paper, we use matrix method to give all primitive idempotents of irreducible cyclic codes of length n, whose prime divisors divide q-1.

A Note on Skew Cyclic Codes over a Class of Rings

2020 ◽  
Vol 27 (04) ◽  
pp. 703-712
Author(s):  
Hai Q. Dinh ◽  
Bac T. Nguyen ◽  
Songsak Sriboonchitta
Keyword(s):  
Finite Field ◽  
Cyclic Code ◽  
Cyclic Codes ◽  
General Setting ◽  
Constacyclic Codes ◽  
Arbitrary Length ◽  
Skew Cyclic Codes

We study skew cyclic codes over a class of rings [Formula: see text], where each [Formula: see text] [Formula: see text] is a finite field. We prove that a skew cyclic code of arbitrary length over R is equivalent to either a usual cyclic code or a quasi-cyclic code over R. Moreover, we discuss possible extension of our results in the more general setting of [Formula: see text]-dual skew constacyclic codes over R, where δR is an automorphism of R.

Linear codes from vectorial Boolean functions in the context of algebraic attacks

2020 ◽  
pp. 2150032
Author(s):  
M. Boumezbeur ◽  
S. Mesnager ◽  
K. Guenda
Keyword(s):  
Boolean Functions ◽  
Linear Codes ◽  
Cyclic Codes ◽  
Weight Enumerator ◽  
Direct Link ◽  
Algebraic Attacks ◽  
Vectorial Boolean Functions ◽  
Lcd Codes ◽  
Vectorial Function ◽  
The Relationship

In this paper, we study the relationship between vectorial (Boolean) functions and cyclic codes in the context of algebraic attacks. We first derive a direct link between the annihilators of a vectorial function (in univariate form) and certain [Formula: see text]-ary cyclic codes (which we show that they are LCD codes). We also present some properties of those cyclic codes as well as their weight enumerator. In addition, we generalize the so-called algebraic complement and study its properties.

Sign in / Sign up

Export Citation Format

Share Document