English
Related papers

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

200 papers

In this paper, we define two matrices named as "difference matrices", denoted by $D$ and $DD$ which significantly contribute to achieve regular single-edge QC-LDPC codes with the shortest length and the certain girth as well as regular and…

Information Theory · Computer Science 2017-09-05 Farzane Amirzade , Mohammad-Reza Sadeghi

We propose a coding scheme that achieves the capacity of the compound MIMO channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned…

Information Theory · Computer Science 2017-01-11 Antonio Campello , Cong Ling , Jean-Claude Belfiore

Multilevel lattice codes, such as those associated to Constructions $C$, $\overline{D}$, D and D', have relevant applications in communications. In this paper, we investigate some properties of lattices obtained via Constructions D and D'…

Information Theory · Computer Science 2024-02-14 Franciele do Carmo Silva , Ana Paula de Souza , Eleonesio Strey , Sueli I. R. Costa

Lattice coding techniques may be used to derive achievable rate regions which outperform known independent, identically distributed (i.i.d.) random codes in multi-source relay networks and in particular the two-way relay channel. Gains stem…

Information Theory · Computer Science 2016-11-17 Yiwei Song , Natasha Devroye , Huai-Rong Shao , Chiu Ngo

Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. To get $q$-ary quantum MDS codes, it suffices to find linear MDS codes $C$ over $\mathbb{F}_{q^2}$ satisfying $C^{\perp_H}\subseteq C$ by the Hermitian…

Information Theory · Computer Science 2014-03-12 Bocong Chen , San Ling , Guanghui Zhang

We obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in $\mathbb{Q}$-division rings by the first author. The lattices in question are lifts of suitable codes from prime characteristic to…

Number Theory · Mathematics 2022-04-12 Nihar Gargava , Vlad Serban

The list-decodable code has been an active topic in theoretical computer science.There are general results about the list-decodability to the Johnson radius and the list-decoding capacity theorem. In this paper we show that rates,…

Information Theory · Computer Science 2022-05-31 Hao Chen

A half-duplex wireless network with 6 lateral nodes, 3 transmitters and 3 receivers, and a central relay is considered. The transmitters wish to send information to their corresponding receivers via a two phase communication protocol. The…

Information Theory · Computer Science 2010-01-22 Hamidreza Ebrahimzadeh Saffar , Patrick Mitran

This paper presents general bounds on the highest achievable rate for list-decodable insertion-deletion codes. In particular, we give novel outer and inner bounds for the highest achievable communication rate of any insertion-deletion code…

Information Theory · Computer Science 2022-08-10 Bernhard Haeupler , Amirbehshad Shahrasbi

Let $\K$ be an algebraic number field of degree $d$ and discriminant $\Delta$ over $\Q$. Let $\A$ be an associative algebra over $\K$ given by structure constants such that $\A\cong M_n(\K)$ holds for some positive integer $n$. Suppose that…

Rings and Algebras · Mathematics 2014-07-11 Gábor Ivanyos , Ádám D. Lelkes , Lajos Rónyai

Four constructions for Ferrers diagram rank-metric (FDRM) codes are presented. The first one makes use of a characterization on generator matrices of a class of systematic maximum rank distance codes. By introducing restricted Gabidulin…

Combinatorics · Mathematics 2019-10-10 Shuangqing Liu , Yanxun Chang , Tao Feng

In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the system performance for all possible transmission rates. It is…

Information Theory · Computer Science 2008-04-30 Yijia Fan , Lifeng Lai , Elza Erkip , H. Vincent Poor

The optimal diversity-multiplexing-delay tradeoff for the multi-input multi-output (MIMO) automatic repeat request (ARQ) channel can be achieved using incremental redundancy lattice space-time codes coupled with a list decoder for joint…

Information Theory · Computer Science 2016-11-17 Walid Abediseid , Mohamed Oussama Damen

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…

Information Theory · Computer Science 2017-04-14 Lin Sok , Minjia Shi , Patrick Solé

In this paper, we consider how to partition the parity-check matrices (PCMs) to reduce the hardware complexity and computation delay for the row layered decoding of quasi-cyclic low-density parity-check (QC-LDPC) codes. First, we formulate…

Information Theory · Computer Science 2022-08-30 Teng Lu , Xuan He , Peng Kang , Jiongyue Xing , Xiaohu Tang

Diversity-Multiplexing tradeoff (DMT) is a coarse high SNR approximation of the fundamental tradeoff between data rate and reliability in a slow fading channel. In this paper, we characterize the fundamental DMT of the two user single…

Information Theory · Computer Science 2009-09-08 Adnan Raja , Pramod Viswanath

This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…

Complex Variables · Mathematics 2026-04-17 Ovaisa Jan , Idrees Qasim

High dimensional integrals are abundant in many fields of research including quantum physics. The aim of this paper is to develop efficient recursive strategies to tackle a class of high dimensional integrals having a special product…

Numerical Analysis · Mathematics 2021-07-28 Tobias Hartung , Karl Jansen , Frances Y. Kuo , Hernan Leövey , Dirk Nuyens , Ian H. Sloan

This work considers space-time block coding for the Rayleigh fading multiple-input multiple-output (MIMO) multiple access channel (MAC). If we suppose that the receiver is performing joint maximum-likelihood (ML) decoding, optimizing a MIMO…

Information Theory · Computer Science 2015-11-16 Toni Ernvall , Jyrki Lahtonen , Hsiao-feng , Lu , Roope Vehkalahti

In this work, a MIMO detection problem is considered. At first, we derive the Generalized Likelihood Ratio Test (GLRT) for arbitrary transmitted signals and arbitrary time-correlation of the disturbance. Then, we investigate design criteria…

Other Computer Science · Computer Science 2022-03-09 Antonio De Maio , Marco Lops , Luca Venturino
‹ Prev 1 4 5 6 7 8 10 Next ›