相关论文: New Semifields and new MRD Codes from Skew Polynom…
In this paper we provide a large family of rank-metric codes, which contains properly the codes recently found by Longobardi and Zanella (2021) and by Longobardi, Marino, Trombetti and Zhou (2021). These codes are…
Planar functions over finite fields give rise to finite projective planes. They were also used in the constructions of DES-like iterated ciphers, error-correcting codes, and codebooks. They were originally defined only in finite fields with…
In this paper, we give semiring version of some classical results in commutative algebra related to Euclidean rings, PIDs, UFDs, G-domains, and GCD and integrally closed domains.
In this thesis, we consider semi-algebraic sets over a real closed field $R$ defined by quadratic polynomials. Semi-algebraic sets of $R^k$ are defined as the smallest family of sets in $R^k$ that contains the algebraic sets as well as the…
We investigate the semi-ringed topos obtained by extension of scalars from the arithmetic site of our previous work, by replacing the smallest Boolean semifield by the tropical semifield of real numbers with the max-plus operations. The…
In this paper we present a concrete algebraic construction of a novel class of convolutional codes. These codes are built upon generalized Vandermonde matrices and therefore can be seen as a natural extension of Reed-Solomon block codes to…
We construct a new family of N-fold supersymmetric systems which is referred to as ``type B''. A higher derivative representation of the N-fold supercharge for this new family is given by a deformation of the type A N-fold supercharge. By…
We present a framework that connects three interesting classes of groups: the twisted groups (also known as Suzuki-Ree groups), the mixed groups and the exotic pseudo-reductive groups. For a given characteristic p, we construct categories…
The quotient hyperfield is a landmark on the borderline of fields and hyperfields. In this paper, which is the second part of our previously published paper, all the hyperfields of order 7 are constructed, enumerated and presented, in the…
In this paper, we construct new families of convolutional codes. Such codes are obtained by means of algebraic geometry codes. Additionally, more families of convolutional codes are constructed by means of puncturing, extending, expanding…
We develop semistrict higher gauge theory from first principles. In particular, we describe the differential Deligne cohomology underlying semistrict principal 2-bundles with connective structures. Principal 2-bundles are obtained in terms…
A semiorder is a model of preference relations where each element $x$ is associated with a utility value $\alpha(x)$, and there is a threshold $t$ such that $y$ is preferred to $x$ iff $\alpha(y) > \alpha(x)+t$. These are motivated by the…
A linear code with parameters of the form $[n, k, n-k+1]$ is referred to as an MDS (maximum distance separable) code. A linear code with parameters of the form $[n, k, n-k]$ is said to be almost MDS (i.e., almost maximum distance separable)…
The article continues the author's publication in [Mech. Tverd. Tela, No. 34, 2004], in which the generalizations of the Appelrot classes of the Kowalevski top motions are found for the case of the double force field. We consider the…
We investigate punctured maximum rank distance codes in cyclic models for bilinear forms of finite vector spaces. In each of these models we consider an infinite family of linear maximum rank distance codes obtained by puncturing…
We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the conjugacy scheme of the symmetric group Sym$(n)$. In particular, we compute orbits of ordered pairs on Sym$(n)$ acted upon by conjugation…
New infinite families of quantum symmetric and asymmetric codes are constructed. Several of these are MDS. The codes obtained are shown to have parameters which are better than previously known. A number of known codes are special cases of…
A class of one-dimensional convolutional codes will be presented. They are all MDS codes, i. e., have the largest distance among all one-dimensional codes of the same length n and overall constraint length delta. Furthermore, their extended…
We describe relations between maximal subfields in a division ring and in its rational extensions. More precisely, we prove that properties such as being Galois or purely inseparable over the centre generically carry over from one to…
This paper provides new constructions and lower bounds for subspace codes, using Ferrers diagram rank-metric codes from matchings of the complete graph and pending blocks. We present different constructions for constant dimension codes with…