Related papers: The nonassociative algebras used to build fast-dec…
In [2], an exhaustive construction is achieved for the class of all 4-dimensional unital division algebras over finite fields of odd order, whose left nucleus is not minimal and whose automorphism group contains Klein's four-group. We…
In this paper non-group permutation modulated sequences for the Gaussian channel are considered. Without the restriction to group codes rather than subsets of group codes, arbitrary rates are achievable. The code construction utilizes the…
Suppose $l,m$ are natural numbers with $l\le m$, and $\mathbb{F}$ a field of characteristic $p$, and let $\mathcal{C}_{l,m}^{\mathbb{F}}$ denote the centraliser of the group algebra $\mathbb{F}S_l$ inside $\mathbb{F}S_m$. Ellers and Murray…
This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. A design criterion based on the normalized minimum determinant is proposed…
A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity gain that…
In this article, we construct linear codes over the commutative non-unital ring $I$ of size four. We obtain their Lee-weight distributions and study their binary Gray images. Under certain mild conditions, these classes of binary codes are…
Raptor codes are rateless codes that achieve the capacity on the binary erasure channels. However the maximum degree of optimal output degree distribution is unbounded. This leads to a computational complexity problem both at encoders and…
We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process which adds the…
A pruned variant of polar coding is proposed for binary erasure channels. For sufficiently small $\varepsilon>0$, we construct a series of capacity achieving codes with block length $N=\varepsilon^{-5}$, code rate…
We construct a new family of explicit codes that are list decodable to capacity and achieve an optimal list size of $O(\frac{1}{\epsilon})$. In contrast to existing explicit constructions of codes achieving list decoding capacity, our…
In this paper we are concentrating on the diversity-multiplexing gain trade-off (DMT) of some space-time lattice codes. First we give a DMT bound for lattice codes having restricted dimension. We then recover the well known results of the…
In this paper, we propose a systematic design of space-time block codes (STBC) which can achieve high rate and full diversity when the partial interference cancellation (PIC) group decoding is used at receivers. The proposed codes can be…
A set grading on the split simple Lie algebra of type $D_{13}$, that cannot be realized as a group-grading, is constructed by splitting the set of positive roots into a disjoint union of pairs of orthogonal roots, following a pattern…
This article can be viewed as a continuation of the articles arXiv:0912.3486 and arXiv:1012.3714 where the decomposable Lie algebras admitting half-flat SU(3)-structures are classified. The new main result is the classification of the…
We construct large families of characteristically nilpotent Lie algebras by considering deformations of the Lie algebra g_{m,m-1}^{4} of type Q_{n},and which arises as a central extension fo the filiform Lie algebra L_{n}. By studying the…
In this paper, we introduce the notion of perfect space-time block codes (STBC). These codes have full rate, full diversity, non-vanishing constant minimum determinant for increasing spectral efficiency, uniform average transmitted energy…
To build large-scale quantum computers while minimizing resource requirements, one may want to use high-rate quantum error-correcting codes that can efficiently encode information. However, realizing an addressable gate$\unicode{x2014}$a…
We analyze semigroups of decomposable maps on C*-algebras in context of the algebraic structure of associated infinitesimal generators. Case of von Neumann algebras, including $B(\mathcal{H})$ for $\mathcal{H}$ a Hilbert space, is also…
A binary matrix is called an s-separable code for the disjunctive multiple-access channel (disj-MAC) if Boolean sums of sets of s columns are all distinct. The well-known issue of the combinatorial coding theory is to obtain upper and lower…
In \cite{shi2022few-weight}, Shi and Li studied $\mathcal{C}_D$-codes over the ring $\mathcal{R}:=\mathbb{F}_2[x,y]/\langle x^2, y^2, xy-yx\rangle$ and their binary Gray images, where $D$ is derived using certain simplicial complexes. We…