# Instantaneous SED coding over a DMC

@article{Guo2021InstantaneousSC, title={Instantaneous SED coding over a DMC}, author={Nian Guo and Victoria Kostina}, journal={2021 IEEE International Symposium on Information Theory (ISIT)}, year={2021}, pages={148-153} }

In this paper, we propose a novel code for transmitting a sequence of $n$ message bits in real time over a discrete-memoryless channel (DMC) with noiseless feedback, where the message bits stream into the encoder one by one at random time instants. Similar to existing posterior matching schemes with block encoding, the encoder in our work takes advantage of the channel feedback to form channel inputs that contain the information the decoder does not yet have, and that are distributed close to…

## 3 Citations

### Reliability function for streaming over a DMC with feedback

- Computer Science2022 IEEE International Symposium on Information Theory (ISIT)
- 2022

This paper considers a streaming source, whose symbols progressively arrive at the encoder at a sequence of deterministic times, and derives the joint source-channel coding (JSCC) reliability function for streaming over a discrete memoryless channel with feedback under regularity conditions.

### Sequential Transmission Over Binary Asymmetric Channels With Feedback

- Computer ScienceIEEE Transactions on Information Theory
- 2022

A non-asymptotic VLF achievability bound is developed that is shown to achieve both capacity and the optimal error exponent in the memoryless binary asymmetric channel (BAC) with full noiseless feedback.

### Optimal Causal Rate-Constrained Sampling for a Class of Continuous Markov Processes

- Computer Science2020 IEEE International Symposium on Information Theory (ISIT)
- 2020

For a class of continuous Markov processes satisfying regularity conditions, it is shown that the optimal encoding policy transmits a 1-bit codeword once the process innovation passes one of two thresholds.

## References

SHOWING 1-10 OF 18 REFERENCES

### Low Complexity Algorithms for Transmission of Short Blocks over the BSC with Full Feedback

- Computer Science2020 IEEE International Symposium on Information Theory (ISIT)
- 2020

Simulation results demonstrate that achievable rates for this full, noiseless feedback system approach capacity rapidly as a function of average blocklength, faster than known finite-blocklength lower bounds on achievable rate withNoiseless active feedback and significantly faster than finite-blocks length lower bounds for a stop feedback system.

### Optimal reliability over a class of binary-input channels with feedback

- Computer Science2012 IEEE Information Theory Workshop
- 2012

A deterministic sequential coding scheme is proposed and shown to attain the optimal error exponent for any binary-input channel whose capacity is achieved by the uniform input distribution.

### Data transmission over a discrete channel with feedback. random transmission time

- Problemy Peredachi Informatsii, vol. 12, no. 4, pp. 10–30, 1975.
- 1975

### Real-time Binary Posterior Matching

- Computer Science, Mathematics2019 IEEE International Symposium on Information Theory (ISIT)
- 2019

This work develops a real-time variant of the renowned Horstein scheme and provides analytical guarantees for its error-probability exponential decay rate and uses the scheme to stabilize an unstable control plant over a binary symmetric channel.

### Sequential transmission using noiseless feedback

- Computer ScienceIEEE Trans. Inf. Theory
- 1963

A sequential continuous-transmission system employing a binary symmetric forward channel and a noiseless feedback channel and its error exponent is shown to be substantially greater than the optimum block-code error exponent at all transmission rates less than channel capacity.

### Causal (Progressive) Encoding over Binary Symmetric Channels with Noiseless Feedback

- Computer Science2021 IEEE International Symposium on Information Theory (ISIT)
- 2021

A four-phase encoder that progressively encodes using only the message bits causally available, and captures additional gains in the interesting region where the transmission rate mu is higher than the rate lambda at which message bits become available.

### The Zero Error Capacity of a Noisy Channel

- Computer Science
- 1993

It is shown that while the ordinary capacity of a memoryless channel with feedback is equal to that of the same channel without feedback, the zero error capacity may be greater and a solution is given to the problem of evaluating C 0F.

### On the error probability for a class of binary recursive feedback strategies

- Computer ScienceIEEE Trans. Inf. Theory
- 1973

It is obtained that even for the nonsequential receiver the error probability vanishes exponentially fast at channel capacity, which was previously obtained by Horstein for the sequential receiver.

### Asymptotic performance of a modified Schalkwijk-Barron scheme for channels with noiseless feedback (Corresp.)

- Computer ScienceIEEE Trans. Inf. Theory
- 1979

A modified Schalkwijk-Barron transmission scheme is presented for channels with noiseless feedback and the new result obtained shows that the modified scheme also attains high reliability functions for DMC's.

### A class of simple and optimal strategies for block coding on the binary symmetric channel with noiseless feedback

- Computer ScienceIEEE Trans. Inf. Theory
- 1971

A class of simple feedback strategies is developed that corrects the largest error fraction possible for certain values of the information rate R.