English
Related papers

Related papers: Uniquely Decodable Ternary Codes for Synchronous C…

200 papers

Recursive list decoding of Reed-Muller (RM) codes, with moderate list size, is known to approach maximum-likelihood (ML) performance of short length $(\leq 256)$ RM codes. Recursive decoding employs the Plotkin construction to split the…

Information Theory · Computer Science 2022-07-20 Mikhail Kamenev

We present the multi-layer extension of the Sparse Ternary Codes (STC) for fast similarity search where we focus on the reconstruction of the database vectors from the ternary codes. To consider the trade-offs between the compactness of the…

Computer Vision and Pattern Recognition · Computer Science 2017-11-01 Sohrab Ferdowsi , Slava Voloshynovskiy , Dimche Kostadinov

We study fountain codes transmitted over the binary-input symmetric-output channel. For channels with small capacity, receivers needs to collects many channel outputs to recover information bits. Since a collected channel output yields a…

Information Theory · Computer Science 2010-07-13 Kenta Kasai , Kohichi Sakaniwa

In this paper, we explore the mystery of synchronous CDMA as applied to wireless and optical communication systems under very general settings for the user symbols and the signature matrix entries. The channel is modeled with real/complex…

Information Theory · Computer Science 2015-03-17 K. Alishahi , S. Dashmiz , P. Pad , F. Marvasti , M. H. Shafinia , M. Mansouri

The joint transmission scheme of polar codes and sparse code multiple access (SCMA) has been regarded as a promising technology for future wireless communication systems. However, most of the existing polar-coded SCMA (PC-SCMA) systems…

Information Theory · Computer Science 2022-04-01 Shufeng Li , Mingyu Cai , Libiao Jin , Yao Sun , Hongda Wu , Ping Wang

In this paper, a new detection algorithm is proposed for turbo coded Code Division Multiple Access (CDMA) signals in detect and forward cooperative channels. Use of user cooperation makes much improvement in the performance of CDMA systems.…

Signal Processing · Electrical Eng. & Systems 2018-03-13 Ebrahim Karami

Random linear network coding (RLNC) in theory achieves the max-flow capacity of multicast networks, at the cost of high decoding complexity. To improve the performance-complexity tradeoff, we consider the design of sparse network codes. A…

Information Theory · Computer Science 2016-04-20 Ye Li , Wai-Yip Chan , Steven D. Blostein

Concatenating the state-of-the-art codes at moderate rates with repetition codes has emerged as a practical solution deployed in various standards for ultra-low-power devices such as in Internet-of-Things (IoT) networks. In this paper, we…

Information Theory · Computer Science 2022-03-24 Fariba Abbasi , Hessam Mahdavifar , Emanuele Viterbo

In this work, we develop a new iterative turbo receiver for LDPC-coded multi-antenna systems based on semidefinite relaxation (SDR). For a classical turbo receiver, forward error correction (FEC) code is only used at decoder. Nonetheless,…

Information Theory · Computer Science 2018-08-21 Kun Wang , Zhi Ding

In this letter, we present a hybrid iterative decoder for non-binary low density parity check (LDPC) codes over binary erasure channel (BEC), based on which the recursion of the erasure probability is derived to design non-binary LDPC codes…

Signal Processing · Electrical Eng. & Systems 2020-03-04 Yang Yu , Wen Chen , Lili Wei

Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered multicast services to a multicast group of users. Reliability of communications…

Information Theory · Computer Science 2016-11-17 Andrea Tassi , Ioannis Chatzigeorgiou , Daniel E. Lucani

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

In this paper, channel optimized distributed multiple description vector quantization (CDMD) schemes are presented for distributed source coding in symmetric and asymmetric settings. The CDMD encoder is designed using a deterministic…

Information Theory · Computer Science 2015-05-20 Mehrdad Valipour , Farshad Lahouti

Recursive list decoding is considered for Reed-Muller (RM) codes. The algorithm repeatedly relegates itself to the shorter RM codes by recalculating the posterior probabilities of their symbols. Intermediate decodings are only performed…

Information Theory · Computer Science 2017-03-17 Ilya Dumer , Kirill Shabunov

Consider a receiver in a multi-user network that wishes to decode several messages. Simultaneous joint typicality decoding is one of the most powerful techniques for determining the fundamental limits at which reliable decoding is possible.…

Information Theory · Computer Science 2019-01-11 Sung Hoon Lim , Chen Feng , Adriano Pastore , Bobak Nazer , Michael Gastpar

This paper describes a new method of data encoding which may be used in various modern digital, computer and telecommunication systems and devices. The method permits the compression of data for storage or transmission, allowing the exact…

Information Theory · Computer Science 2012-01-27 Igor Nesiolovskiy , Artem Nesiolovskiy

In the near future, the $5^{th}$ generation (5G) wireless systems will be established. They will consist of an integration of different techniques, including distributed antenna systems and massive multiple-input multiple-output systems,…

Information Theory · Computer Science 2017-10-17 Amaro Barreal , Camilla Hollanti

Multi-user spatial modulation (SM) assisted by sparse code multiple access (SCMA) has been recently proposed to provide uplink high spectral efficiency transmission. The message passing algorithm (MPA) is employed to detect the transmitted…

Signal Processing · Electrical Eng. & Systems 2020-08-19 Ibrahim Al-Nahhal , Octavia A. Dobre , Salama Ikki

Locally decodable codes (LDCs) are error-correcting codes $C : \Sigma^k \to \Sigma^n$ that admit a local decoding algorithm that recovers each individual bit of the message by querying only a few bits from a noisy codeword. An important…

Computational Complexity · Computer Science 2020-09-17 Vahid R. Asadi , Igor Shinkar

The 3D MIMO code is a robust and efficient space-time coding scheme for the distributed MIMO broadcasting. However, it suffers from the high computational complexity if the optimal maximum-likelihood (ML) decoding is used. In this paper we…

Information Theory · Computer Science 2014-01-08 Ming Liu , Jean-François Hélard , Matthieu Crussière , Maryline Hélard