Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Errors-and-erasures decoding for block codes with feedback
Download
index.pdf
Date
2008-08-08
Author
Nakiboğlu, Barış
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
165
views
75
downloads
Cite This
Fixed length block codes on discrete memoryless channels with feedback are considered for errors and erasures decoding. Upper and lower bounds are derived for the error exponent in terms of the rate and the erasure exponents. In addition the converse result of Burnashev for variable length block codes is extended to include list decoding.
Subject Keywords
Channels
,
Bounds
URI
https://hdl.handle.net/11511/47528
DOI
https://doi.org/10.1109/isit.2008.4595079
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Errors-and-Erasures Decoding for Block Codes With Feedback
Nakiboğlu, Barış (2012-01-01)
Inner and outer bounds are derived on the optimal performance of fixed-length block codes on discrete memoryless channels with feedback and errors-and-erasures decoding. First, an inner bound is derived using a two-phase encoding scheme with communication and control phases together with the optimal decoding rule for the given encoding scheme, among decoding rules that can be represented in terms of pairwise comparisons between the messages. Then, an outer bound is derived using a generalization of the stra...
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...
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.
Remote estimation of the Wiener process over a channel with random delay
Sun, Yin; Polyanskiy, Yury; Uysal, Elif (2017-06-25)
In this paper, we consider a problem of sampling a Wiener process, with samples forwarded to a remote estimator via a channel that consists of a queue with random delay. The estimator reconstructs a real-time estimate of the signal from causally received samples. Motivated by recent research on age of-information, we study the optimal sampling strategy that minimizes the mean square estimation error subject to a sampling frequency constraint. We prove that the optimal sampling strategy is a threshold policy...
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.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
B. Nakiboğlu, “Errors-and-erasures decoding for block codes with feedback,” 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47528.