Skew lattices are the most successful generalization of lattices to the noncommutative case to date. Roughly speaking, each skew lattice can be seen as a lattice of rectangular bands. A coset decomposition can be given to each pair of comparable maximal rectangular bands. The internal structure of skew lattices is revealed by their coset structure. In the present paper we study the coset struct...

We give a new characterization of the bounded nilradical. Using the interplay between this and previous characterizations, we prove that the bounded nilradical is a graded ideal if the ring is graded. This allows us to completely determine the bounded nilradical of skew polynomial and skew Laurent polynomial rings in terms of information in the coefficient ring.

The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming distance is gained, and it is possible to design efficient decoding algorithms. In this paper, we give a version of the Hartmann-Tzeng bound that works for a wide ...

We introduce a new class of noncommutative rings-Galois orders, realized as certain subrings of invariants in skew semigroup rings, and develop their structure theory. The class of Galois orders generalizes classical orders in noncommutative rings and contains many classical objects, such as the Generalized Weyl algebras, the universal enveloping algebra of the general linear Lie algebra, assoc...

We show that error and erasure decoding of `-Interleaved Gabidulin codes, as well as list-` decoding of Mahdavifar–Vardy codes can be solved by row reducing skew polynomial matrices. Inspired by row reduction of F[x] matrices, we develop a general and flexible approach of transforming matrices over skew polynomial rings into certain normal forms. We apply this to solve generalised shift registe...