Related papers: On Codes based on BCK-algebras
Associative division algebras are a rich source of fully diverse space-time block codes (STBCs). In this paper the systematic construction of fully diverse STBCs from nonassociative algebras is discussed. As examples, families of fully…
There have been rapid developments in model-based clustering of graphs, also known as block modelling, over the last ten years or so. We review different approaches and extensions proposed for different aspects in this area, such as the…
A new method for the experimental study of bin-bin correlations is proposed. It is shown that this method is able to reveal important additional information on bin-bin correlations, beyond that of factorial-correlator measurements.
In the paper the main attention is paid to conditions on algebras from a given variety which provide coincidence of their algebraic geometries. The main part here play the notions mentioned in the title of the paper.
The purpose of this paper is to introduce Hom-prealternative superalgebras and their bimodules. Some constructions of Hom-prealternative superalgebras and Hom-alternative superalgebras are given, and their connection with Hom-alternative…
The purpose of this paper is to introduce Hom-alternative algebras and Hom-Jordan algebras. We discuss some of their properties and provide construction procedures using ordinary alternative algebras or Jordan algebras. Also, we show that a…
BD algebras (Beilinson-Drinfeld algebras) are algebraic structures which are defined similarly to BV algebras (Batalin-Vilkovisky algebras). The equation defining the BD operator has the same structure as the equation for BV algebras, but…
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…
Non-binary codes correcting multiple deletions have recently attracted a lot of attention. In this work, we focus on multiplicity-free codes, a family of non-binary codes where all symbols are distinct. Our main contribution is a new…
Boolean functions have important applications in cryptography and coding theory. Two famous classes of binary codes derived from Boolean functions are the Reed-Muller codes and Kerdock codes. In the past two decades, a lot of progress on…
A brief description of tree structured sparse coding on the binary cube.
We study a new class of codes over Z_2 x Z_2 which we call L-codes. They arise as a natural fifth step in a series of analogies between Kleinian codes, binary codes, lattices and vertex operator algebras. This analogy will be explained in…
The aim of this paper is to give some construction results and examples of BiHom-alternative and BiHom-Jordan algebras. Next, we define BiHom-alternative and BiHom-Jordan (bi)modules and we prove that from a given BiHom-alternative and…
In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic…
We investigate point-line geometries whose singular subspaces correspond to binary equidistant codes. The main result is a description of automorphisms of these geometries. In some important cases, automorphisms induced by non-monomial…
In this paper, we construct self-dual codes from a construction that involves both block circulant matrices and block quadratic residue circulant matrices. We provide conditions when this construction can yield self-dual codes. We construct…
This work is devoted to study new bialgebra structures related to 2-associative algebras. A 2-associative algebra is a vector space equipped with two associative multiplications. We discuss the notions of 2-associative bialgebras,…
The order statistics based list decoding techniques for linear binary block codes of small to medium block length are investigated. The construction of the list of the test error patterns is considered. The original order statistics…
We present a novel technique for encoding and decoding constant weight binary codes that uses a geometric interpretation of the codebook. Our technique is based on embedding the codebook in a Euclidean space of dimension equal to the weight…
We describe recent advances in the study of random analogues of combinatorial theorems.