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

Latin Squares and Their Applications to Cryptography

A latin square of order-n is an n x n array over a set of n symbols such that every symbol appears exactly once in each row and exactly once in each column. Latin squares encode features of algebraic structures. When an algebraic structure passes certain latin square tests , it is a candidate for use in the construction of cryptographic systems. A transversal of a latin square is a list of n distinct symbols, one from each row and each column. The question regarding the existence of transversals in latin squares that encode the Cayley tables of finite groups is far from being resolved and is an area of active investigation. It is known that counting the pairs of permutations over a Galois field ��pd whose point-wise sum is also a permutation is equivalent to counting the transversals of a latin square that encodes the addition group of ��pd. We survey some recent results and conjectures pertaining to latin squares and transversals. We create software tools that generate latin squares and count their transversals. We confirm previous results that cyclic latin squares of prime order-p possess the maximum transversal counts for 3 ≤ p ≤ 9. Furthermore, we create a new algorithm that uses these prime order-p cyclic latin squares as building blocks to construct super-symmetric latin squares of prime power order-pd with d \u3e 0; using this algorithm we accurately predict that super-symmetric latin squares of order-pd possess the confirmed maximum transversal counts for 3 ≤ pd ≤ 9 and the estimated lower bound on the maximum transversal counts for 9 \u3c pd ≤ 17. Also, we give some conjectures regarding the number of transversals in a super-symmetric latin square. Lastly, we use the super-symmetric latin square for the additive group of the Galois field (��32, +) to create a simplified version of Grøstl, an iterated hash function, where the compression function is built from two fixed, large, distinct permutations

An introduction of the theory of nonlinear error-correcting codes

Nonlinear error-correcting codes are the topic of this thesis. As a class of codes, it has been investigated far less than the class of linear error-correcting codes. While the latter have many practical advantages, it the former that contain the optimal error-correcting codes. In this project the theory (with illustrative examples) of currently known nonlinear codes is presented. Many definitions and theorems (often with their proofs) are presented thus providing the reader with the opportunity to experience the necessary level of mathematical rigor for good understanding of the subject. Also, the examples will give the reader the additional benefit of seeing how the theory can be put to use. An introduction to a technique for finding new codes via computer search is presented

Rational Covariance Extension, Multivariate Spectral Estimation, and Related Moment Problems: Further Results and Applications

This dissertation concerns the problem of spectral estimation subject to moment constraints. Its scalar counterpart is well-known under the name of rational covariance extension which has been extensively studied in past decades. The classical covariance extension problem can be reformulated as a truncated trigonometric moment problem, which in general admits infinitely many solutions. In order to achieve positivity and rationality, optimization with entropy-like functionals has been exploited in the literature to select one solution with a fixed zero structure. Thus spectral zeros serve as an additional degree of freedom and in this way a complete parametrization of rational solutions with bounded degree can be obtained. New theoretical and numerical results are provided in this problem area of systems and control and are summarized in the following. First, a new algorithm for the scalar covariance extension problem formulated in terms of periodic ARMA models is given and its local convergence is demonstrated. The algorithm is formally extended for vector processes and applied to finite-interval model approximation and smoothing problems. Secondly, a general existence result is established for a multivariate spectral estimation problem formulated in a parametric fashion. Efforts are also made to attack the difficult uniqueness question and some preliminary results are obtained. Moreover, well-posedness in a special case is studied throughly, based on which a numerical continuation solver is developed with a provable convergence property. In addition, it is shown that solution to the spectral estimation problem is generally not unique in another parametric family of rational spectra that is advocated in the literature. Thirdly, the problem of image deblurring is formulated and solved in the framework of the multidimensional moment theory with a quadratic penalty as regularization

Éléments explicites en théorie algébrique des nombres

This report consists in a synthesis of my research activities in algebraic number theory, between 2003 and 2013, on my own or with colleagues. The main goal is the study of the Galois module structure of modules associated to number field extensions, under various hypothesis, specifically about ramification. We also present results about other subjects which came into the way of the previous study: the construction of a certain type of Galois extensions of the field of rationals, the complexity of self-dual normal bases for multiplication in finite fields, and a bit of combinatorics. We stress the importance of an explicit knowledge of the objects under study.Ce mémoire présente une synthèse de mes travaux de recherche en théorie algébrique des nombres menés entre 2003 et 2013, seul ou en collaboration. Ils portent principalement sur l'étude de la structure galoisienne de modules associés à des extensions de corps de nombres, sous diverses hypothèses en particulier de ramification. Ils abordent aussi des thèmes rencontrés chemin faisant : construction d'un certain type d'extensions galoisiennes du corps des rationnels, complexité des bases normales auto-duales pour la multiplication dans les corps finis, un peu de combinatoire. Dans la présentation de tous ces travaux, l'accent est mis sur l'aspect explicite des objets étudiés

Algebraic methods for the distance of cyclic codes

In this thesis we provide known and new results which explain the relationship between the actual minimum distance of cyclic codes, bounds that use only information on the defining sets of cyclic codes to lower bound the distance (root bounds) and bounds that also need the knowledge of the defining sets of all cyclic subcodes (border bounds). We propose a new bound which is provably better of many known bounds and that can be computed in polynomial time with respect to the length of the code. We sketch how to use the generalized Newton identities to give alternative proofs of known bounds. Finally, we use Groebner bases to prove that the optimal root bound can be computed in finite time