English
Related papers

Related papers: Full-Diversity Construction-D Lattices: Design and…

200 papers

Precoding with block diagonalization is an attractive scheme for approaching sum capacity in multiuser multiple input multiple output (MIMO) broadcast channels. This method requires either global channel state information at every receiver…

Information Theory · Computer Science 2007-07-13 Seijoon Shim , Chan-Byoung Chae , Robert W. Heath

Reconfigurability is a desired characteristic of future communication networks. From a transceiver's standpoint, this can be materialized through the implementation of fluid antennas (FAs). An FA consists of a dielectric holder, in which a…

Signal Processing · Electrical Eng. & Systems 2023-07-26 Constantinos Psomas , Ghassan M. Kraidy , Kai-Kit Wong , Ioannis Krikidis

We restate a process presented by Stanley as a technique to prove that there exists exactly one $d$-differential distributive lattice for any positive integer $d$. This process can be trivially extended to apply to distributive finitary…

Combinatorics · Mathematics 2026-04-14 Dale R. Worley

A finite blocklenth analysis of the diversity-multiplexing tradeoff is presented, based on nonasymptotic bounds on the maximum channel coding rate of multiple-antenna block-memoryless Rayleigh-fading channels.The bounds in this paper allow…

Information Theory · Computer Science 2016-11-17 Johan Östman , Wei Yang , Giuseppe Durisi , Tobias Koch

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

Deep learning aided codes have been shown to improve code performance in feedback codes in high noise regimes due to the ability to leverage non-linearity in code design. In the additive white Gaussian broadcast channel (AWGN-BC), the…

Signal Processing · Electrical Eng. & Systems 2024-10-24 Jacqueline Malayter , Christopher Brinton , David Love

Algebraic lattices are those obtained from modules in the ring of integers of algebraic number fields through the canonical or twisted embeddings. In turn, well-rounded lattices are those with maximal cardinality of linearly independent…

In this paper we consider a channel model that is often used to describe the mobile wireless scenario: multiple-antenna additive white Gaussian noise channels subject to random (fading) gain with full channel state information at the…

Information Theory · Computer Science 2018-06-28 Austin Collins , Yury Polyanskiy

The design of codes for feedback-enabled communications has been a long-standing open problem. Recent research on non-linear, deep learning-based coding schemes have demonstrated significant improvements in communication reliability over…

Information Theory · Computer Science 2023-06-09 Junghoon Kim , Taejoon Kim , David Love , Christopher Brinton

In this paper, we give a new framework for constructing low ML decoding complexity Space-Time Block Codes (STBCs) using codes over the finite field $\mathbb{F}_4$. Almost all known low ML decoding complexity STBCs can be obtained via this…

Information Theory · Computer Science 2010-08-17 Lakshmi Prasad Natarajan , B. Sundar Rajan

Massive connectivity with ultra-low latency and high reliability necessitates fundamental advances in future communication networks operating under finite-blocklength (FBL) transmission. Fluid antenna systems (FAS) have emerged as a…

We propose a variation of Construction A of lattices from linear codes defined using the quotient $\Lambda/\mathfrak p\Lambda$ of some order $\Lambda$ inside a cyclic division $F$-algebra, for $\mathfrak p$ a prime ideal of a number field…

Information Theory · Computer Science 2015-06-22 Jérôme Ducoat , Frédérique Oggier

We propose an approach for optimizing nonbinary (NB) quasi-cyclic (QC) LDPC codes. This approach combines constructing of base parity-check matrices by simulated annealing and labeling the obtained base matrices aimed at maximizing the…

Information Theory · Computer Science 2020-10-23 Irina E. Bocharova , Boris D. Kudryashov , Evgenii P. Ovsyannikov , Vitaly Skachek , Tähvend Uustalu

In this work, we explore the introduction of distributed space-time codes in decode-and-forward (DF) protocols. A first protocol named the Asymmetric DF is presented. It is based on two phases of different lengths, defined so that signals…

Information Theory · Computer Science 2008-11-05 Charlotte Hucher , Ghaya Rekaya-Ben Othman , Ahmed Saadani

For LDPC codes operating over additive white Gaussian noise channels and decoded using message-passing decoders with limited precision, absorbing sets have been shown to be a key factor in error floor behavior. Focusing on this scenario,…

Information Theory · Computer Science 2012-12-07 Jiadong Wang , Lara Dolecek , Richard Wesel

Error correction codes are a crucial part of the physical communication layer, ensuring the reliable transfer of data over noisy channels. The design of optimal linear block codes capable of being efficiently decoded is of major concern,…

Information Theory · Computer Science 2024-05-08 Yoni Choukroun , Lior Wolf

Linear nested codes, where two or more sub-codes are nested in a global code, have been proposed as candidates for reliable multi-terminal communication. In this paper, we consider nested array-based spatially coupled low-density…

Information Theory · Computer Science 2021-02-23 Salman Habib , David G. M. Mitchell , Joerg Kliewer

In large scale distributed storage systems (DSS) deployed in cloud computing, correlated failures resulting in simultaneous failure (or, unavailability) of blocks of nodes are common. In such scenarios, the stored data or a content of a…

Information Theory · Computer Science 2017-02-22 Gokhan Calis , O. Ozan Koyluoglu

We propose a lattice construction from totally real and CM fields, which naturally generalizes the Construction A of lattices from $p$-ary codes obtained from the cyclotomic field $\mathbb{Q}(\zeta_p)$, $p$ a prime, which in turn contains…

Information Theory · Computer Science 2016-11-15 Wittawat Kositwattanarerk , Soon Sheng Ong , Frédérique Oggier

The recent work of Sommer, Feder and Shalvi presented a new family of codes called low density lattice codes (LDLC) that can be decoded efficiently and approach the capacity of the AWGN channel. A linear time iterative decoding scheme which…

Information Theory · Computer Science 2010-03-23 Danny Bickson , Alexander T. Ihler , Danny Dolev