相关论文: Codes over subsets of algebras obtained by the Cay…
In this paper we improve the level and sublevel of algebras obtained by the Cayley-Dickson process when their level and sublevel are greater than dimension of the algebras.
This paper is a short survey about some properties of algebras ob- tained by the Cayley-Dickson process and some of their applications.
In the last time some papers were devoted to the study of the con- nections between binary block codes and BCK-algebras. In this paper, we try to generalize these results to n-ary block codes, providing an algorithm which allows us to…
In this paper, we will provide an algorithm which allows us to find a BCK-algebra starting from a given block code.
In this paper, we will study some connections between Hilbert al- gebras and binary block-codes.With these codes, we can eassy obtain orders which determine suplimentary properties on these algebras. We will try to emphasize how, using…
Recently, Lin and Pryadko presented the quantum two-block group algebra codes, a generalization of bicycle codes obtained from Cayley graphs of non-Abelian groups. We notice that their construction is naturally suitable to obtain a quantum…
In this paper, we present some new connections between BCK- algebras and binary block codes.
Starting from some ideas given by Bales in [Ba; 09], in this paper we present an algorithm for computing the elements of the basis in an algebra obtained by the Cayley-Dickson process. As a consequence of this result, we prove that an…
An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…
We present here some results of applying the Cayley-Dickson process to certain alternative algebras (notably built upon Galois fields and congruence rings), in a manner which might yield new building blocks for cryptographic systems. We…
In this paper we will prove that any number n\in N-{0} could be realised as level of an algebra obtained by the Cayley-Dickson process over a suitable field.
Finding identities in nonassociative algebras plays an important role in the study of properties of these algebras. In this paper, we present some identities in alternative algebras and in algebras obtained by the Cayley-Dickson process.…
In this paper, we define a special class of elements in the algebras obtained by the Cayley Dickson process, called l elements. We find conditions such that these elements to be invertible. These conditions can be very useful for finding…
New families of eight-dimensional real division algebras with large derivation algebra are presented: We generalize the classical Cayley-Dickson doubling process starting with a unital algebra with involution over a field F by allowing the…
In this work, we introduce a framework to study the effect of random operations on the combinatorial list-decodability of a code. The operations we consider correspond to row and column operations on the matrix obtained from the code by…
In this paper we provide some properties of k-potent elements in algebras obtained by the Cayley-Dickson process over Zp. Moreover, we find a structure of nonunitary ring over Fibonacci quaternions over Z3 and we present a method to encrypt…
In this paper, we generalize the concepts of level and sublevels of a composition algebra to algebras obtained by the Cayley-Dickson process. In 1967, R. B. Brown constructed, for every $t\in \Bbb{N},$ a division algebra $A_{t}$ of…
In this paper, we give some properties of the levels and sublevels of algebras obtained by the Cayley-Dickson process. We will emphasize how isotropy of some quadratic forms can influence the levels and sublevels of algebras obtained by the…
This paper is concerned with list decoding of $2$-interleaved binary alternant codes. The principle of the proposed algorithm is based on a combination of a list decoding algorithm for (interleaved) Reed-Solomon codes and an algorithm for…
This paper addresses the problem of learning binary hash codes for large scale image search by proposing a novel hashing method based on deep neural network. The advantage of our deep model over previous deep model used in hashing is that…