Upper Bounds to Error Probability with Feedback

Download
2009-08-18
A new technique is proposed for upper bounding the error probability of fixed length block codes with feedback. Error analysis is inspired by Gal lager's error analysis for block codes without feedback. Zigangirov-D'yachkov (Z-D) encoding scheme is analyzed with the technique on binary input channels and k-ary symmetric channels. A strict improvement is obtained for k-ary symmetric channels.

Suggestions

Upper bounds to error probability with feedback
Nakiboğlu, Barış (2010-01-22)
A new analysis technique is suggested for bounding the error probability of fixed length block codes with feedback on discrete memoryless channels from above. Error analysis is inspired by Gal lager's error analysis for block codes without feedback. Using Burnashev-Zigangirov-D'yachkov encoding scheme analysis recovers previously known best results on binary symmetric channels and improves up on the previously known best results on k-ary symmetric channels and binary input channels.
Bit-wise Unequal Error Protection for Variable Length Blockcodes with Feedback
Gorantla, Siva K; Nakiboğlu, Barış; Coleman, Todd P; Zheng, Lizhong (2010-07-23)
Bit-wise unequal error protection problem with two layers is considered for variable length block-codes with feedback. Inner and outer bounds are derived for achievable performance for finite expected decoding time. These bounds completely characterize the error exponent of the special bits as a function of overall rate R, overall error exponent E and the rate of the special bits R-s. Single message Message-wise unequal protection problem is also solved as a step on the way.
Bit-Wise Unequal Error Protection for Variable-Length Block Codes With Feedback
Nakiboğlu, Barış; Zheng, Lizhong; Coleman, Todd P (2013-03-01)
The bit-wise unequal error protection problem, for the case when the number of groups of bits is fixed, is considered for variable-length block codes with feedback. An encoding scheme based on fixed-length block codes with erasures is used to establish inner bounds to the achievable performance for finite expected decoding time. A new technique for bounding the performance of variable-length block codes is used to establish outer bounds to the performance for a given expected decoding time. The inner and th...
High Rate Communication over One-Bit Quantized Channels via Deep Learning and LDPC Codes
Balevi, Eren; Andrews, Jeffrey G. (2020-05-01)
This paper proposes a method for designing error correction codes by combining a known coding scheme with an autoencoder. Specifically, we integrate an LDPC code with a trained autoencoder to develop an error correction code for intractable nonlinear channels. The LDPC encoder shrinks the input space of the autoencoder, which enables the autoencoder to learn more easily. The proposed error correction code shows promising results for one-bit quantization, a challenging case of a nonlinear channel. Specifical...
Optimal Control of Diffusion Convection Reaction Equations Using Upwind Symmetric Interior Penalty Galerkin SIPG Method
Karasözen, Bülent; Yücel, Hamdullah (2012-05-01)
We discuss the numerical solution of linear quadratic optimal control problem with distributed and Robin boundary controls governed by diffusion convection reaction equations. The discretization is based on the upwind symmetric interior penalty Galerkin (SIPG) methods which lead to the same discrete scheme for the optimize-then-discretize and the discretize-then-optimize.
Citation Formats
B. Nakiboğlu, “Upper Bounds to Error Probability with Feedback,” 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42094.