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
Error Exponents for Variable-length block codes with feedback and cost constraints
Download
index.pdf
Date
2006-12-26
Author
Nakiboğlu, Barış
Win, Moe Z
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
133
views
73
downloads
Cite This
Variable-length block-coding schemes are investigated for discrete memoryless channels (DMC) with perfect feedback under cost constraints. Upper and lower bounds are found for the minimum achievable probability of decoding error P-e,P- min as a function of transmission rate R, cost constraint P, and expected block length tau. For given P and R, the lower and upper bounds to the exponent -(ln P-e,P- min)/tau are asymptotically equal as tau -> infinity. The reliability function, Iim(tau ->infinity) (-ln P-e,P-min)/tau, as a function of P and R, is concave in the pair (P, R) and generalizes the linear reliability function of Burnashev [1] to include cost constraints.
Subject Keywords
Additive noise channels
,
Coding scheme
URI
https://hdl.handle.net/11511/42965
DOI
https://doi.org/10.1109/isit.2006.261677
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Error exponents for variable-length block codes with feedback and cost constraints
Nakiboğlu, Barış (Institute of Electrical and Electronics Engineers (IEEE), 2008-03-01)
Variable-length block-coding schemes are investigated for discrete memoryless channels with ideal feedback under cost constraints. Upper and lower bounds are found for the minimum achievable probability of decoding error P-e,P-min as a function of constraints R, P, and T on the transmission rate, average cost, and average block length, respectively. For given R and P, the lower and upper bounds to the exponent -(In P-e,P-min)/(T) over bar are asymptotically equal as (T) over bar -> infinity. The resulting r...
Errors-and-erasures decoding for block codes with feedback
Nakiboğlu, Barış (2008-08-08)
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.
Autoencoder-Based Error Correction Coding for One-Bit Quantization
Balevi, Eren; Andrews, Jeffrey G. (2020-06-01)
This paper proposes a novel deep learning-based error correction coding scheme for AWGN channels under the constraint of one-bit quantization in receivers. Specifically, it is first shown that the optimum error correction code that minimizes the probability of bit error can be obtained by perfectly training a special autoencoder, in which "perfectly" refers to converging the global minima. However, perfect training is not possible in most cases. To approach the performance of a perfectly trained autoencoder...
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...
Approximate Bayesian Smoothing with Unknown Process and Measurement Noise Covariances
Ardeshiri, Tohid; Özkan, Emre; Orguner, Umut; Gustafsson, Fredrik (2015-12-01)
We present an adaptive smoother for linear state-space models with unknown process and measurement noise covariances. The proposed method utilizes the variational Bayes technique to perform approximate inference. The resulting smoother is computationally efficient, easy to implement, and can be applied to high dimensional linear systems. The performance of the algorithm is illustrated on a target tracking example.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
B. Nakiboğlu and M. Z. Win, “Error Exponents for Variable-length block codes with feedback and cost constraints,” 2006, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42965.