English
Related papers

Related papers: Generalized ABBA Space-Time Block Codes

200 papers

Tensor-based modulation (TBM) provides a multi-linear spreading framework for blind multi-user separation in unsourced random access. In this paper, we show that TBM is a coded modulation built on a non-binary linear block code over…

Information Theory · Computer Science 2026-03-10 Sweta Suresh , Charly Poulliat , Claire Goursaud , Maxime Guillaud

Orthogonal designs are fundamental mathematical notions used in the construction of space time block codes for wireless transmissions. Designs have two important parameters, the rate and the decoding delay; the main problem of the theory is…

Information Theory · Computer Science 2012-03-05 Sophie Morier-Genoud , Valentin Ovsienko

A coding scheme for broadcast channels (BCs) is proposed that shifts the users' code blocks by different amounts of time and applies alternating Gelfand-Pinsker encoding. The scheme achieves all rate tuples in Marton's region for two…

Information Theory · Computer Science 2025-07-08 Constantin Runge , Gerhard Kramer

Block-fading (BF) channel, also known as slow-fading channel, is a type of simple and practical channel model that can characterize the primary feature of a number of wireless-communication applications with low to moderate mobility.…

Information Theory · Computer Science 2021-07-22 Yi Fang , Pingping Chen , Guofa Cai , Francis C. M. Lau , Soung Chang Liew , Guojun Han

We compare four open-loop transmit diversity schemes in a coded Orthogonal Frequency Division Multiplexing (OFDM) system with four transmit antennas, namely cyclic delay diversity (CDD), Space-Time Block Code (STBC, Alamouti code is used)…

Information Theory · Computer Science 2008-06-24 Chau Yuen , Yan Wu , Sumei Sun

This study focuses on (traditional and unsourced) multiple-access communication over a single transmit and multiple ($M$) receive antennas. We assume full or partial channel state information (CSI) at the receiver. It is known that to fully…

Information Theory · Computer Science 2023-07-04 Alexander Fengler , Alejandro Lancho , Yury Polyanskiy

Iterative decoding techniques have gain popularity due to their performance and their application in most communications systems. In this paper, we present a new application of our iterative decoder on the GPCB (Generalized Parallel…

Information Theory · Computer Science 2012-11-14 Hamid Allouch , Idriss Chana , Mostafa Belkasmi

Binary linear block codes (BLBCs) are essential to modern communication, but their diverse structures often require tailor-made decoders, increasing complexity. This work introduces enhanced polar decoding ($\mathsf{PD}^+$), a universal…

Information Theory · Computer Science 2025-05-16 Chien-Ying Lin , Yu-Chih Huang , Shin-Lin Shieh , Po-Ning Chen

We analyze a class of high performance, low decoding-data-flow error-correcting codes suitable for high bit-rate optical-fiber communication systems. A spatially-coupled split-component ensemble is defined, generalizing from the most…

Information Theory · Computer Science 2015-12-04 Lei M. Zhang , Dmitri Truhachev , Frank Kschischang

In this work, we analyze efficient window shift schemes for windowed decoding of spatially coupled low-density parity-check (SC-LDPC) codes, which is known to yield close-tooptimal decoding results when compared to full belief propagation…

Information Theory · Computer Science 2018-10-03 Kevin Klaiber , Sebastian Cammerer , Laurent Schmalen , Stephan ten Brink

Modulo-wrapping receivers have attracted interest in several areas of digital communications, including precoding and lattice coding. The asymptotic capacity and error performance of the modulo AWGN channel have been well established.…

Information Theory · Computer Science 2021-05-21 Gizem Tabak , Andrew Singer

This paper describes design of a low-complexity algorithm for adaptive encoding/ decoding of binary sequences produced by memoryless sources. The algorithm implements universal block codes constructed for a set of contexts identified by the…

Information Theory · Computer Science 2007-07-13 Yuriy A. Reznik

We consider the problem of universal decoding for arbitrary unknown channels in the random coding regime. For a given random coding distribution and a given class of metric decoders, we propose a generic universal decoder whose average…

Information Theory · Computer Science 2016-11-17 Neri Merhav

The fundamental performance limits of space-time block code (STBC) designs when perfect channel information is available at the transmitter (CSIT) are studied in this report. With CSIT, the transmitter can perform various techniques such as…

Information Theory · Computer Science 2015-03-19 Liangbin Li , Hamid Jafarkhani

Block encoding is a successful technique used in several powerful quantum algorithms. In this work we provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure. The proposed methodology is…

We introduce the concept of generalized concatenated quantum codes. This generalized concatenation method provides a systematical way for constructing good quantum codes, both stabilizer codes and nonadditive codes. Using this method, we…

Quantum Physics · Physics 2009-05-24 Markus Grassl , Peter Shor , Graeme Smith , John Smolin , Bei Zeng

This paper proposes a novel maximum-likelihood (ML) soft-decision decoding framework for linear block codes, termed error-building decoding (EBD). The complete decoding process can be performed using only the parity-check matrix, without…

Information Theory · Computer Science 2026-01-06 Guoda Qiu , Ling Liu , Yuejun Wei , Liping Li

Generalized spatial modulation (GSM) is a spectral-efficient technique used in multiple-input multiple-output (MIMO) wireless communications when the number of radio frequency chains at the transmitter is less than the number of transmit…

Information Theory · Computer Science 2020-08-11 Lakshit Singla , Lakshmi Natarajan

In this work, lossy distributed compression of pairs of correlated sources is considered. Conventionally, Shannon's random coding arguments -- using randomly generated unstructured codebooks whose blocklength is taken to be asymptotically…

Information Theory · Computer Science 2020-10-21 Farhad Shirani , S. Sandeep Pradhan

This paper proposes the Symbolic-Stochastic Chase Decoding Algorithm (S-SCA) for the Reed-Solomon (RS) and BCH codes. By efficient usage of void space between constellation points for $q$-ary modulations and using soft information at the…

Information Theory · Computer Science 2017-07-17 Hossein Mani , Saied Hemati