We define a class of automorphisms rational function fields finite characteristic and employ these to construct different types optimal linear rank-metric codes. The first construction is generalized Gabidulin codes over fields. Reducing fields, we obtain maximum rank distance (MRD) which are not equivalent twisted also Ferrers diagram settles further conjecture by Etzion Silberstein.

A simple algorithm for lattice reduction of polynomial matrices is described and analysed. The algorithm is adapted and applied to various tasks, including rank profile and determinant computation, transformation to Hermite and Popov canonical form, polynomial linear system solving and short vector computation. © 2003 Elsevier Science Ltd. All rights reserved.

A sparse precision matrix can be directly translated into a sparse Gaussian graphical model under the assumption that the data follow a joint normal distribution. This neat property makes high-dimensional precision matrix estimation very appealing in many applications. However, in practice we often face nonnormal data, and variable transformation is often used to achieve normality. In this pape...

The paper is devoted to the study of some important types of minimal artinian linear groups. The authors prove that in such classes of groups as hypercentral groups (so also, nilpotent and abelian groups) and FC-groups, minimal artinian linear groups have precisely the same structure as the corresponding irreducible linear groups. 2000 Mathematics Subject Classification. 20E36, 20F28. Let F be ...

Linear set in projective spaces over finite fields plays central roles the study of blocking sets, semifields, rank-metric codes and etc. A linear with largest possible cardinality maximum rank is called scattered. Despite two decades study, there are only a few number known scattered sets lines, including family constructed by Csajb\'ok, Marino, Polverino Zanella 2018, Zullo 2018 (also Montanu...

in this paper, we introduce $p$-semilinear transformations for linear algebras over a field ${bf f}$ of positive characteristic $p$, discuss initially the elementary properties of $p$-semilinear transformations, make use of it to give some characterizations of linear algebras over a field ${bf f}$ of positive characteristic $p$. moreover, we find a one-to-one correspondence between $p$-semiline...

quadratic equation is eigen-decomposed to build a linear This paper proposes a linear algorithm for metric equation to compute the projective-to-Euclidean trans-reconstruction from projective reconstruction. Metric formation matrix. reconstruction problem is equivalent to estimating the projective transformation matrix that converts projective reconstruction to Euclidean reconstruction. We buil...

There is a famous construction of orthogonal arrays by R.C. Bose (1947). The construction uses linear transformations over a finite field. We generalize this to use non-linear transformation instead of linear and a subset of vector space as their domains. We show here constructions of orthogonal and balanced arrays which are generated by a set of quadratic function.