English
Related papers

Related papers: The nonassociative algebras used to build fast-dec…

200 papers

For an infinite family of monogenic trinomials $P(X) = X^3\pm 3rbX-b$ in $\mathbb{Z}\lbrack X\rbrack$, arithmetical invariants of the cubic number field $L = \mathbb{Q}(\theta)$, generated by a zero $\theta$ of $P(X)$, and of its Galois…

Number Theory · Mathematics 2022-04-12 Daniel C. Mayer , Abderazak Soullami

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p \times n$ matrix, where nonzero entries are filled by $\pm z_i$ or $\pm z^*_i$, $i = 1, 2,..., k$, such…

Information Theory · Computer Science 2012-04-03 Yuan Li , Haibin Kan

In this paper, we study a class of spatially coupled turbo codes, namely partially information- and partially parity-coupled turbo codes. This class of codes enjoy several advantages such as flexible code rate adjustment by varying the…

Information Theory · Computer Science 2020-12-25 Min Qiu , Xiaowei Wu , Alexandre Graell i Amat , Jinhong Yuan

Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), encode messages $s$ in a manner so that tampering the codeword causes the decoder to either output $s$ or a message that is independent of $s$. While this is an…

Information Theory · Computer Science 2013-09-03 Mahdi Cheraghchi , Venkatesan Guruswami

We analyze $\mathrm{C}^\ast$-algebras, particularly AF-algebras, and their $K_0$-groups in the context of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$. Given two separable unital AF-algebras $A$ and $B$, and considering their…

Logic · Mathematics 2022-04-11 Ben De Bondt , Andrea Vaccaro , Boban Velickovic , Alessandro Vignati

The Higgs sector of the low-energy physics of n of coincident D-branes contains the necessary elements for constructing noncommutative manifolds. The coordinates orthogonal to the coincident branes, as well as their conjugate momenta, take…

High Energy Physics - Theory · Physics 2009-11-10 J. M. Isidro

In the context of space-time block codes (STBCs), the theory of generalized quaternion and biquaternion algebras (i.e., tensor products of two quaternion algebras) over arbitrary base fields is presented, as well as quadratic form theoretic…

Information Theory · Computer Science 2012-02-07 Thomas Unger , Nadya Markin

We propose non-binary LDPC codes concatenated with multiplicative repetition codes. By multiplicatively repeating the (2,3)-regular non-binary LDPC mother code of rate 1/3, we construct rate-compatible codes of lower rates 1/6, 1/9,…

Information Theory · Computer Science 2011-07-14 Kenta Kasai , David Declercq , Charly Poulliat , Kohichi Sakaniwa

In this paper, we consider a quasi-orthogonal (QO) space-time block code (STBC) with minimum decoding complexity (MDC-QO-STBC). We formulate its algebraic structure and propose a systematic method for its construction. We show that a…

Information Theory · Computer Science 2007-07-13 Chau Yuen , Yong Liang Guan , Tjeng Thiang Tjhung

Strong difference families of special types are introduced to produce new relative difference families from the point of view of both asymptotic existences and concrete examples. As applications, group divisible designs of type $30^u$ with…

Combinatorics · Mathematics 2019-08-27 Yanxun Chang , Simone Costa , Tao Feng , Xiaomiao Wang

I present here some new results which make explicit the role of the division algebras R,C,H,O in the construction and classification of, respectively, N=1,2,4,8 global supersymmetric quantum mechanical and classical dynamical systems. In…

High Energy Physics - Theory · Physics 2009-11-07 F. Toppan

(Strong) circular external difference families (which we denote as CEDFs and SCEDFs) can be used to construct nonmalleable threshold schemes. They are a variation of (strong) external difference families, which have been extensively studied…

Combinatorics · Mathematics 2023-10-30 Maura B. Paterson , Douglas R. Stinson

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…

Information Theory · Computer Science 2009-08-07 H. Gluesing-Luerssen , U. Helmke , J. I. Iglesias Curto

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…

Information Theory · Computer Science 2023-01-18 Hai Liu , Chengju Li , Cunsheng Ding

In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code sets for overloaded synchronous optical code-division multiple-access (O-CDMA) systems. The proposed decoder is designed in a such a way that the…

Information Theory · Computer Science 2019-02-27 Michel Kulhandjian , Hovannes Kulhandjian , Claude D'Amours , Halim Yanikomeroglu , Gurgen Khachatrian

This paper presents two new space time block codes (STBCs) with quasi orthogonal structure for an open loop multi-input single-output (MISO) systems. These two codes have been designed to transmit from three or four antennas at the…

Information Theory · Computer Science 2016-05-20 Ali Lotfi-Rezaabad , Siamak Talebi , Ata Chizari

In this work, we consider the problem of coding for the half-duplex non-orthogonal amplify-and-forward (NAF) cooperative channel where the transmitter to relay and the inter-relay links are highly reliable. We derive bounds on the diversity…

Information Theory · Computer Science 2016-11-15 Ghassan M. Kraidy , Nicolas Gresset , Joseph J. Boutros

We give an example of an exact, stably finite, simple. separable C*-algebra D which is not isomorphic to its opposite algebra. Moreover, D has the following additional properties. It is stably finite, approximately divisible, has real rank…

Operator Algebras · Mathematics 2014-01-22 N. Christopher Phillips , Maria Grazia Viola

Consider an assignment of bits to the vertices of a connected graph $G(V,E)$ with the property that the value of each vertex is a function of the values of its neighbors. A collection of such assignments is called a {\em storage code} of…

Information Theory · Computer Science 2023-03-07 Alexander Barg , Gilles Zémor

The upcoming 5G networks demand high-speed and high spectral-efficiency communications to keep up with the proliferating traffic demands. To this end, Massive multiple-input multiple-output (MIMO) techniques have gained significant traction…

Information Theory · Computer Science 2019-08-06 Anu Jagannath , Jithin Jagannath , Andrew Drozd