How to obtain lattices from (f,σ,δ)-codes via a generalization of Construction A

We show how cyclic (f,σ,δ)-codes over finite rings canonically induce a Z-lattice in RN by using certain quotients of orders in nonassociative division algebras defined using the skew polynomial f. This construction generalizes the one using certain σ-constacyclic codes by Ducoat and Oggier, which used quotients of orders in non-commutative associative division algebras defined by f, and can be viewed as a generalization of the classical Construction A for lattices from linear codes. It has the potential to be applied to coset coding, in particular to wire-tap coding. Previous results by Ducoat and Oggier are obtained as special cases

Finite nonassociative algebras obtained from skew polynomials and possible applications to (f, σ, δ)-codes

Let S be a unital ring, S[t; σ, δ] a skew polynomial ring where σ is an injective endomorphism and δ a left σ -derivation, and suppose f ε S[t; σ, δ] has degree m and an invertible leading coefficient. Using right division by f to define the multiplication, we obtain unital nonassociative algebras Sf on the set of skew polynomials in S[t; σ, δ] of degree less than m. We study the structure of these algebras. When S is a Galois ring and f base irreducible, these algebras yield families of finite unital nonassociative rings A, whose set of (left or right) zero divisors has the form pA for some prime p. For reducible f, the Sf can be employed both to design linear (f, σ, δ)-codes over unital rings and to study their behaviour

Petit Algebras and their Automorphisms

In this thesis, we study the properties of a nonassociative algebra construction from skew polynomial rings. This construction was introduced by Petit in the 1960s but largely ignored until recently. In particular, the automorphism groups of these algebras are studied, paying particular attention to the case when the construction yields a finite semifield. The thesis is concluded by revisiting a result on associative solvable crossed product algebras by both Petit and Albert. We show a crossed product algebra is solvable if and only if it can be written as a chain of Petit algebras satisfying certain conditions