English
Related papers

Related papers: Code loops: automorphisms and representations

200 papers

In this paper are defined cohomology-like groups that classify loop extensions satisfying a given identity in three variables for association identities, and in two variables for the case of commutativity. It is considered a large amount of…

K-Theory and Homology · Mathematics 2020-05-18 Rolando Jiménez Benítez , Quitzeh Morales Meléndez

The generic structure of 4-point functions of fields residing in indecomposable representations of arbitrary rank is given. The presented algorithm is illustrated with some non-trivial examples and permutation symmetries are exploited to…

High Energy Physics - Theory · Physics 2015-06-26 Michael Flohr , Marco Krohn

Let $V$ be a cubic surface defined by the equation $T_0^3+T_1^3+T_2^3+\theta T_3^3=0$ over a quadratic extension of 3-adic numbers $k=\mathbb{Q}_3(\theta)$, where $\theta^3=1$. We show that a relation on a set of geometric k-points on $V$…

Number Theory · Mathematics 2023-06-21 Dimitri Kanevsky

Two classes of turbo codes over high-order finite fields are introduced. The codes are derived from a particular protograph sub-ensemble of the (dv=2,dc=3) low-density parity-check code ensemble. A first construction is derived as a…

Information Theory · Computer Science 2016-11-17 Gianluigi Liva , Enrico Paolini , Sandro Scalise , Marco Chiani

We study $C_{a, b}$ curves and their applications to coding theory. Recently, Joyner and Ksir have suggested a decoding algorithm based on the automorphisms of the code. We show how $C_{a, b}$ curves can be used to construct MDS codes and…

Information Theory · Computer Science 2019-05-30 T. Shaska , Q. Wang

We compute the generating functions of a O(n) model (loop gas model) on a random lattice of any topology. On the disc and the cylinder, they were already known, and here we compute all the other topologies. We find that the generating…

Mathematical Physics · Physics 2015-05-14 G. Borot , B. Eynard

Computer architectures become more and more complex. It requires more effort to develop techniques that improve the programs of performance and allow to exploit material resources efficiently. As a result, many transformations are applied…

Programming Languages · Computer Science 2019-08-06 Asma Balamane , Zina Taklit

We describe the structure of the algebraic group of automorphisms of all simple finite dimensional Lie superalgebras. Using this and \'etale cohomology considerations, we list all different isomorphism classes of the corresponding twisted…

Rings and Algebras · Mathematics 2007-05-23 Dimitar Grantcharov , Arturo Pianzola

A new class of 3-manifold invariants is constructed from representations of the category of framed tangles.

Geometric Topology · Mathematics 2016-05-20 Olaf Müller

In program semantics and verification, reasoning about loops is complicated by the need to produce two separate mathematical arguments: an invariant, for functional properties (ignoring termination); and a variant, for termination (ignoring…

Programming Languages · Computer Science 2025-04-14 Bertrand Meyer

A class of linear block codes which simultaneously generalizes Gabidulin codes and a class of skew cyclic codes is defined. For these codes, both a Hartmann-Tzeng-like bound and a Roos-like bound, with respect to their rank distance, are…

Information Theory · Computer Science 2025-03-18 José Manuel Muñoz

We describe the finite-dimensional simple modules of all the (twisted and untwisted) multiloop algebras and classify them up to isomorphism.

Representation Theory · Mathematics 2008-12-02 Michael Lau

Numeral systems across the world's languages vary in fascinating ways, both regarding their synchronic structure and the diachronic processes that determined how they evolved in their current shape. For a proper comparison of numeral…

We study the polyregular string-to-string functions, which are certain functions of polynomial output size that can be described using automata and logic. We describe a system of combinators that generates exactly these functions. Unlike…

Logic in Computer Science · Computer Science 2023-04-27 Mikołaj Bojańczyk

A bijection $f$ of a loop $L$ is a half-automorphism if $f(xy)\in \{f(x)f(y),f(y)f(x)\}$, for any $x,y\in L$. A half-automorphism is nontrivial when it is neither an automorphism nor an anti-automorphism. A Chein loop $L=G\cup Gu$ is a…

Group Theory · Mathematics 2020-08-11 Giliard Souza dos Anjos

A loop is said to be automorphic if its inner mappings are automorphisms. For a prime $p$, denote by $\mathcal A_p$ the class of all $2$-generated commutative automorphic loops $Q$ possessing a central subloop $Z\cong \mathbb Z_p$ such that…

Group Theory · Mathematics 2015-09-21 Dylene Agda Souza de Barros , Alexander Grishkov , Petr Vojtěchovský

In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.

Information Theory · Computer Science 2017-06-28 Long Yu , Xiusheng Liu

In this paper, we develop the notion of representability of co-dimension three cycles on a fourfold in terms of zero cycles modulo rational equivalence on surfaces.

Algebraic Geometry · Mathematics 2026-04-23 Kalyan Banerjee

This paper investigates the concept of self-dual convolutional code. We derive the basic properties of this interesting class of codes and we show how some of the techniques to construct self-dual linear block codes generalize to self-dual…

Information Theory · Computer Science 2022-08-09 Sebastian Heri , Julia Lieb , Joachim Rosenthal

We give intrinsic characterizations of neural rings and homomorphisms between them. Also we introduce the notion of a basic monomial code map and characterize monomial code maps as compositions of basic monomial code maps. Finally, we…

Commutative Algebra · Mathematics 2020-01-03 Katie Christensen , Hamid Kulosman