Related papers: On Codes from Split Metacyclic Groups
McEliece encryption scheme which enjoys relatively small key sizes as well as a security reduction to hard problems of coding theory. Furthermore, it remains secure against a quantum adversary and is very well suited to low cost…
We study the structure of Jacobians of geometrically reduced curves over arbitrary (i. e., not necessarily perfect) fields. We show that, while such a group scheme cannot in general be decomposed into an affine and an Abelian part as over…
Semiconstrained systems were recently suggested as a generalization of constrained systems, commonly used in communication and data-storage applications that require certain offending subsequences be avoided. In an attempt to apply…
In this paper, we establish the conditions for some finite abelian groups and the family all the $k$-sets in each of them summing up to an element $x$ to form $t$-designs. We fully characterize the sufficient and necessary conditions for…
We consider Cayley sum graphs over the cyclic group $\mathbb{Z}_n$ and aim to explore several necessary and sufficient conditions for the existence of total perfect codes in these graphs. Specifically, we examine various cases for the…
In this paper we study some special classes of division algebras over a Laurent series field with arbitrary residue field. We call the algebras from these classes as splittable and good splittable division algebras. It is shown that these…
Recently, several cryptosystems have been proposed based semidirect products of various algebraic structures. Efficient attacks against several of them have already been given, along with a very general attack. The purpose of this note is…
New soft- and hard decision decoding algorithms are presented for general Reed-Muller codes $\left\{\genfrac{}{}{0pt}{}{m}{r}\right\} $ of length $2^{m}$ and distance $2^{m-r}$. We use Plotkin $(u,u+v)$ construction and decompose code…
A generalization of the semisimplicity concept for polyadic algebraic structures is proposed. If semisimple structures can be presented in block diagonal matrix form (resulting in the Wedderburn decomposition), a general form of polyadic…
We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalizes the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and…
We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined over finite fields. We give a general bound on their minimum distance and we investigate how this estimation can be sharpened under the…
In his Ph.D. disseration, Feldman and his collaborators define the linear programming decoder for binary linear codes, which is a linear programming relaxation of the maximum-likelihood decoding problem. This decoder does not, in general,…
In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family…
The $n$-slice algebra is introduced as a generalization of path algebra in higher dimensional representation theory. In this paper, we give a classification of $n$-slice algebras via their $(n+1)$-preprojective algebras and the trivial…
As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and…
We combine results about Whitehead groups of finite groups with results about genetic bases of finite $p$-groups to compute the Whitehead groups of some metacyclic $p$-groups. Let $C_{p^n}$ denote a cyclic group of order $p^n$ for $p$ an…
We prove that there exists a functorial correspondence between MV-algebras and partially cyclically ordered groups which are wound round of lattice-ordered groups. It follows that some results about cyclically ordered groups can be stated…
Most of the codes that have an algebraic decoding algorithm are derived from the Reed Solomon codes. They are obtained by taking equivalent codes, for example the generalized Reed Solomon codes, or by using the so-called subfield subcode…
A new method for the construction of the binary quantum stabilizer codes is provided, where the construction is based on Abelian and non-Abelian groups association schemes. The association schemes based on non-Abelian groups are constructed…
An important family of codes for data storage systems, cryptography, consumer electronics, and network coding for error control in digital communications are the so-called cyclic codes. This kind of linear codes are also important due to…