Related papers: Linear representations of convolutional codes over…
This paper investigates the application of the theoretical algebraic notion of a separable ring extension, in the realm of cyclic convolutional codes or, more generally, ideal codes. We work under very mild conditions, that cover all…
This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the…
A commutative ring R has finite rank r, if each ideal of R is generated at most by r elements. A commutative ring R has the r-generator property, if each finitely generated ideal of R can be generated by r elements. Such rings are closely…
We introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is…
We consider the class of all commutative reduced rings for which there exists a finite subset T of A such that all projections on quotients by prime ideals of A are surjective when restricted to T. A complete structure theorem is given for…
We restructure and advance the classification theory of finite racks and quandles by employing powerful methods from transformation groups and representation theory, especially Burnside rings. These rings serve as universal receptacles for…
For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some…
In this note we develop a coalgebraic approach to the study of solutions of linear difference equations over modules and rings. Some known results about linearly recursive sequences over base fields are generalized to linearly (bi)recursive…
A concept of "evolving categories" is suggested to build a simple, scalable, mathematically consistent framework for representing in uniform way both data and algorithms. A state machine for executing algorithms becomes clear, rich and…
We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…
We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…
We prove that a complete local or graded one-dimensional domain of prime characteristic has finite F-representation type if its residue field is algebraically closed or finite, and present examples of a complete local or graded…
We provide a sufficient condition for a polynomial ring, not necessarily commutative, to have a first-order definition for the rational integers.
We discuss a cohomological construction of representations of a reductive group over the ring of power series over a finite field modulo the r-th power of the maximal ideal. The case r=1 goes back to Deligne and the author. The case where r…
We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…
We define Langlands parameters for connected reductive groups over finite fields and formulate the Langlands correspondence for finite fields using these parameters.
For any constacyclic code over a finite commutative chain ring of length coprime to the characteristic of the ring, we construct explicitly generator polynomials and check polynomials, and exhibit a BCH bound for such constacyclic codes. As…
Motivated by a problem in quantum field theory, we study the up and down structure of circular and linear permutations. In particular, we count the length of the (alternating) runs of permutations by representing them as monomials and find…
For arbitrary F-algebra, in which the operation of addition is defined, I explore biring of matrices of mappings. The sum of matrices is determined by the sum in F-algebra, and the product of matrices is determined by the product of…
We introduce unitary representations of continuous groupoids on continuous fields of Hilbert spaces. We investigate some properties of these objects and discuss some of the standard constructions from representation theory in this…