English
Related papers

Related papers: Instantaneous SED coding over a DMC

200 papers

Recently, the ever-increasing demand for bandwidth in multi-modal communication systems requires a paradigm shift. Powered by deep learning, semantic communications are applied to multi-modal scenarios to boost communication efficiency and…

Signal Processing · Electrical Eng. & Systems 2023-05-19 Yangshuo He , Guanding Yu , Yunlong Cai

The Accumulative Iterative Code (AIC) proposed in this work is a new error correcting code for channels with feedback. AIC sends the information message to the receiver in a number of transmissions, where the initial transmission contains…

Information Theory · Computer Science 2021-06-15 Alberto G. Perotti , Branislav M. Popovic , Anahid R. Safavi

A diffusion molecular channel is a channel with memory, as molecules released into the medium hit the receptors after a random delay. Coding over the diffusion channel is performed by choosing the type, intensity, or the released time of…

We consider streaming data transmission over a discrete memoryless channel. A new message is given to the encoder at the beginning of each block and the decoder decodes each message sequentially, after a delay of $T$ blocks. In this…

Information Theory · Computer Science 2015-12-22 Si-Hyeon Lee , Vincent Y. F. Tan , Ashish Khisti

Mobile edge caching (MEC) has received much attention as a promising technique to overcome the stringent latency and data hungry requirements in the future generation wireless networks. Meanwhile, full-duplex (FD) transmission can…

Information Theory · Computer Science 2019-11-01 Thang X. Vu , Symeon Chatzinotas , Björn Ottersten , Anh Vu Trinh

A real time coding system with lookahead consists of a memoryless source, a memoryless channel, an encoder, which encodes the source symbols sequentially with knowledge of future source symbols upto a fixed finite lookahead, d, with or…

Information Theory · Computer Science 2011-05-31 Himanshu Asnani , Tsachy Weissman

In this paper, a streaming transmission setup is considered where an encoder observes a new message in the beginning of each block and a decoder sequentially decodes each message after a delay of $T$ blocks. In this streaming setup, the…

Information Theory · Computer Science 2016-04-26 Si-Hyeon Lee , Vincent Y. F. Tan , Ashish Khisti

We study a discrete-memoryless relay network consisting of one source, one destination and N relays, and design a scheme based on partial decode-forward relaying. The source splits its message into one common and N+1 private parts, one…

Information Theory · Computer Science 2013-03-28 Yao Tang , Mai Vu

Consider a memoryless degraded broadcast channel (DBC) in which the channel output is a single-letter function of the channel input and the channel noise. As examples, for the Gaussian broadcast channel (BC) this single-letter function is…

Information Theory · Computer Science 2011-10-25 Bike Xie , Thomas Courtade , Richard D. Wesel

The secure multiplex coding (SMC) is a technique to remove rate loss in the coding for wire-tap channels and broadcast channels with confidential messages caused by the inclusion of random bits into transmitted signals. SMC replaces the…

Information Theory · Computer Science 2016-09-28 Masahito Hayashi , Ryutaroh Matsumoto

We present a new deep-neural-network (DNN) based error correction code for fading channels with output feedback, called deep SNR-robust feedback (DRF) code. At the encoder, parity symbols are generated by a long short term memory (LSTM)…

Information Theory · Computer Science 2021-12-23 Mahdi Boloursaz Mashhadi , Deniz Gunduz , Alberto Perotti , Branislav Popovic

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

Our primary goal in this paper is to traverse the performance gap between two linear network coding schemes: random linear network coding (RLNC) and instantly decodable network coding (IDNC) in terms of throughput and decoding delay. We…

Information Theory · Computer Science 2013-09-06 Mingchao Yu , Neda Aboutorab , Parastoo Sadeghi

We consider transmission of discrete memoryless sources (DMSes) across discrete memoryless channels (DMCs) using variable-length lossy source-channel codes with feedback. The reliability function (optimum error exponent) is shown to be…

Information Theory · Computer Science 2019-04-09 Lan V. Truong , Vincent Y. F. Tan

Building on the work of Horstein, Shayevitz and Feder, and Naghshvar \emph{et al.}, this paper presents algorithms for low-complexity sequential transmission of a $k$-bit message over the binary symmetric channel (BSC) with full, noiseless…

Information Theory · Computer Science 2020-05-19 Amaael Antonini , Hengjie Yang , Richard D. Wesel

We propose two coding schemes for the two-receiver discrete memoryless broadcast channel (BC) with rate-limited feedback from one or both receivers. They improve over the nofeedback capacity region for a large class of channels, including…

Information Theory · Computer Science 2016-02-19 Youlong Wu , Michèle Wigger

In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them to the destination such that the signal at the destination…

Information Theory · Computer Science 2008-06-20 J. Harshan , B. Sundar Rajan

Separate Source-Channel Coding (SSCC) remains attractive for text transmission due to its modularity and compatibility with mature entropy coders and powerful channel codes. However, SSCC often suffers from a pronounced cliff effect in low…

Machine Learning · Computer Science 2026-01-16 Ziqiong Wang , Tianqi Ren , Rongpeng Li , Zhifeng Zhao , Honggang Zhang

This paper considers the input-constrained binary memoryless symmetric (BMS) channel, without feedback. The channel input sequence respects the $(d,\infty)$-runlength limited (RLL) constraint, which mandates that any pair of successive $1$s…

Information Theory · Computer Science 2022-01-07 V. Arvind Rameshwar , Navin Kashyap

In this work, we propose a dynamic buffer-aided distributed space-time coding (DSTC) scheme for cooperative direct-sequence code-division multiple access systems. We first devise a relay selection algorithm that can automatically select the…

Information Theory · Computer Science 2016-08-17 J. Gu , R. C. de Lamare