A5078389977- Coding theory and cryptography
- Rings, Modules, and Algebras
- graph theory and CDMA systems
- Finite Group Theory Research
- Commutative Algebra and Its Applications
- Cooperative Communication and Network Coding
- Algebraic Geometry and Number Theory
- Quantum Computing Algorithms and Architecture
- Polynomial and algebraic computation
- Advanced Topics in Algebra
- Cellular Automata and Applications
- Advanced Algebra and Logic
- Quantum-Dot Cellular Automata
- semigroups and automata theory
- Algebraic structures and combinatorial models
- advanced mathematical theories
- Graph theory and applications
- Recommender Systems and Techniques
- Cognitive Computing and Networks
- Mathematical Control Systems and Analysis
- Error Correcting Code Techniques
- Information Systems and Technology Applications
- Image Retrieval and Classification Techniques
- Advanced Algebra and Geometry
- Computability, Logic, AI Algorithms
Vyatka State University
2019-2023
Lomonosov Moscow State University
1999-2020
Kirov State Medical Academy
2019
Samara State Technical University
2019
Moscow State University
1997-2012
Rostov State University of Civil Engineering
2002
Linear recurrences of maximal period over a Galois ring and residue class modulo p are studied. For any such recurrence, the coordinate sequences (in p-adic some other expansions) considered as linear recurring finite field. Upper lower bounds for ranks (linear complexities) these obtained. The results based on using properties rings trace-function rings.
The problem of describing the lengths independent cycles in indicated substitution reduces to case where ring and characteristic polynomial corresponding matrix are primary. concept a distinguished over primary (local) R is introduced studied. These polynomials used obtain formulas for cycle types linear substitutions that generalize known field. If principal ideal ring, practically computable. In Galois there given complete description maximal order an algorithm enumerating such...
Let G be a finite group and F field. We show that all G-codes over are abelian if the order of is less than 24, but for = ℤ 5 S 4 there exist non-abelian F, answering to an open problem posed in [J. J. Bernal, Á. del Río Simón, An intrinsical description codes, Des. Codes Cryptogr.51(3) (2009) 289–300]. This related decomposability as product two subgroups. consider this case p-groups, finding minimal which p-groups such decomposable. Finally, we study fact remains true when base field changed.
Abstract We investigate the possibility to use non-associative groupoids in realization of an open key distribution procedure based on a generalization well known Diffie-Hellman algorithm.We prove existence groupoidswhich are simultaneously power commuting and not power-associative.
Article Canonical generating system of a monic polynomial ideal over commutative Artinian chain ring was published on January 1, 2001 in the journal Discrete Mathematics and Applications (volume 11, issue 6).
We give a complete description (with the use of computation) best parameters linear codes that correspond to left ideals in loop algebras F q L for ∈ {2,3,4,5} and | ≤ 7, also group G groups order 12. distinguish linearly optimal codes, satisfying Varshamov–Hilbert condition as well those which Plotkin bound is attained. The results suggest research constructed by using non-associative non-semisimple non-commutative can open new possibilities deserves be developed.