Related papers: On the factor set of code loops

We prove that if the squaring map in the factor loop of a Moufang loop $Q$ over its nucleus is surjective, then every half-isomorphism of $Q$ onto a Moufang loop is either an isomorphism or an anti-isomorphism. This generalizes all earlier…

Boolean functions have very nice applications in cryptography and coding theory, which have led to a lot of research focusing on their applications. The objective of this paper is to construct binary linear codes with few weights from the…

Let $\mathbb{F}_{q}$ be the finite field with $q$ elements. This paper mainly researches the polynomial representation of double cyclic codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^2\mathbb{F}_{q}$ with $v^3=v$. Firstly, we give the…

We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…

The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to…

A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. The term calculus is proved complete for a semantics in linearly distributive…

We consider the problem of coded distributed computing where a large linear computational job, such as a matrix multiplication, is divided into $k$ smaller tasks, encoded using an $(n,k)$ linear code, and performed over $n$ distributed…

Let $C_{n_1}\cup C_{n_2}\cup \ldots \cup C_{n_k}$ be a 2-factor i.e. a vertex-disjoint union of cycles. In this note we completely characterize those 2-factors that are uniquely embeddeble in their complement.

We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration…

Linear codes are the most important family of codes in cryptography and coding theory. Some codes have only a few weights and are widely used in many areas, such as authentication codes, secret sharing schemes and strongly regular graphs.…

This paper investigates the theory of sum-rank metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory…

For bilinear Fourier multipliers that contain some oscillatory factors, boundedness of the operators between Lebesgue spaces is given including endpoint cases. Sharpness of the result is also considered.

We analyze different ways of constructing binary extended formulations of mixed-integer problems with bounded integer variables and compare their relative strength with respect to split cuts. We show that among all binary extended…

The dual complex of a singularity is defined, up-to homotopy, using resolutions of singularities. In many cases, for instance for isolated singularities, we identify and study a "minimal" representative of the homotopy class that is well…

We study additive quaternary codes whose parameters are close to those of the extended cyclic [12; 6; 6]4-code or to the quaternary linear codes generated by the elliptic quadric in PG(3; 4) or its dual. In particular we characterize those…

A code is called solid if, roughly speaking, any correctly-transmitted codeword in an arbitrarily corrupted string of codewords can still be decoded correctly and unambiguously. So-called variable-length solid codes, in which codewords may…

Conic linear programs, among them semidefinite programs, often behave pathologically: the optimal values of the primal and dual programs may differ, and may not be attained. We present a novel analysis of these pathological behaviors. We…

The representation sets of central loops are investigated and the results obtained are used to construct a finite C-loop. It is shown that for certain types of isotopisms, the central identities are isotopic invariant.

We show that factorization systems, both strict and orthogonal, can be equivalently described as double categories satisfying certain properties. This provides conceptual reasons for why the category of sets and partial maps or the category…

We define class-closing factor codes from shifts of finite type and show that they are continuing if their images are of finite type. We establish several relations between class-closing factor codes, continuing factor codes and…