English
Related papers

Related papers: The DMT classification of real and quaternionic la…

200 papers

In this work the optimal diversity-multiplexing tradeoff (DMT) is investigated for the multiple-input multiple-output fading multiple-access channels with no power constraints (infinite constellations). For K users (K>1), M transmit…

Information Theory · Computer Science 2015-05-22 Yair Yona , Meir Feder

We analyze two-user single-antenna fading interference channels with perfect receive channel state information (CSI) and no transmit CSI. For the case of very strong interference, we prove that decoding interference while treating the…

Information Theory · Computer Science 2009-05-04 Cemal Akçaba , Helmut Bölcskei

Real-valued block codes are introduced, which are derived from Discrete Fourier Transforms (DFT) and Discrete Hartley Transforms (DHT). These algebraic structures are built from the eigensequences of the transforms. Generator and parity…

Information Theory · Computer Science 2015-02-10 H. M. de Oliveira , C. M. F. Barros , R. M. Campello de Souza

Multi-twisted (MT) codes were introduced as a generalization of quasi-twisted (QT) codes. QT codes have been known to contain many good codes. In this work, we show that codes with good parameters and desirable properties can be obtained…

Information Theory · Computer Science 2020-08-18 Nuh Aydin , Thomas Guidotti , Peihan Liu

Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…

Information Theory · Computer Science 2017-01-05 Nuh Aydin , Ajdin Halilovic

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. In contrast to the standard approach in the literature which employs random…

Information Theory · Computer Science 2015-01-28 Laura Luzzi , Roope Vehkalahti

In this article, the first general constructions of fast-decodable, more specifically (conditionally) $g$-group decodable, space-time block codes for the Nonorthogonal Amplify and Forward (NAF) Multiple-Input Multiple-Output (MIMO) relay…

Information Theory · Computer Science 2015-12-11 Amaro Barreal , Camilla Hollanti , Nadya Markin

Sum-rank metric codes are a natural extension of both linear block codes and rank-metric codes. They have several applications in information theory, including multishot network coding and distributed storage systems. The aim of this…

Information Theory · Computer Science 2023-04-25 Elisa Gorla , Umberto Martínez-Peñas , Flavio Salizzoni

We relate proper isometry classes of maximal lattices in a totally definite quaternary quadratic space (V,q) with trivial discriminant to certain equivalence classes of ideals in the quaternion algebra representing the Clifford invariant of…

Number Theory · Mathematics 2018-09-11 Markus Kirschmer , Gabriele Nebe

A new design method for high rate, fully diverse ('spherical') space frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary numbers of antennas and subcarriers. The construction exploits a differential geometric…

Information Theory · Computer Science 2016-11-17 Oliver Henkel

A new ensemble of structured codes is introduced. These codes are called Quasi Linear Codes (QLC). The QLC's are constructed by taking subsets of linear codes. They have a looser structure compared to linear codes and are not closed under…

Information Theory · Computer Science 2016-02-16 F. Shirani , M. Heidari , S. S. Pradhan

In this paper, we introduce distributed matrix multiplication (DMM)-friendly algebraic function fields for polynomial codes and Matdot codes, and present several constructions for such function fields through extensions of the rational…

Information Theory · Computer Science 2025-11-04 Yun Long Zhu , Chang-An Zhao

We provide an algorithm to construct unitary matrices over finite fields. We present various constructions of Hermitian self-dual code by means of unitary matrices, where some of them generalize the quadratic double circulant constructions.…

Information Theory · Computer Science 2019-11-26 Lin Sok

Lattice codes with optimal decoding coefficient are capacity-achieving when dimension $N \rightarrow \infty$. In communications systems, finite dimensional lattice codes are considered, where the optimal decoding coefficients may still fail…

Information Theory · Computer Science 2025-01-09 Jiajie Xue , Brian M. Kurkoski

The current paper investigates the bounded distance decoding (BDD) problem for ensembles of lattices whose generator matrices have sub-Gaussian entries. We first prove that, for these ensembles the BDD problem is NP-hard in the worst case.…

Computational Complexity · Computer Science 2025-06-23 Shuhong Gao

We introduce Decision Tree Decoders (DTDs), which rely only on the sparsity of the binary check matrix, making them broadly applicable for decoding any quantum low-density parity-check (qLDPC) code and fault-tolerant quantum circuits. DTDs…

Quantum Physics · Physics 2025-02-25 Kai R. Ott , Bence Hetényi , Michael E. Beverland

Using duality in optimization theory we formulate a dual approach to the S-matrix bootstrap that provides rigorous bounds to 2D QFT observables as a consequence of unitarity, crossing symmetry and analyticity of the scattering matrix. We…

High Energy Physics - Theory · Physics 2020-12-02 Andrea L Guerrieri , Alexandre Homrich , Pedro Vieira

This work presents an extension of the Construction $\pi_A$ lattices proposed in \cite{huang2017construction}, to Hurwitz quaternion integers. This construction is provided by using an isomorphism from a version of the Chinese remainder…

Information Theory · Computer Science 2025-05-23 Juliana G. F. Souza , Sueli I. R. Costa , Cong Ling

Network coding and cooperative communication have received considerable attention from the research community recently in order to mitigate the adverse effects of fading in wireless transmissions and at the same time to achieve high…

Information Theory · Computer Science 2010-04-20 Hakan Topakkaya , Zhengdao Wang

This paper contributes to the study of rank-metric codes from an algebraic and combinatorial point of view. We introduce $q$-polymatroids, the $q$-analogue of polymatroids, and develop their basic properties. We associate a pair of…

Information Theory · Computer Science 2019-09-06 Elisa Gorla , Relinde Jurrius , Hiram H. López , Alberto Ravagnani