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
2008-03-01
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
174
views
57
downloads
Cite This
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 reliability function, lim((T) over bar ->infinity) (- In P-e,P-min)/(T) over bar, as a function of R and P, is concave in the pair (R,P) and generalizes the linear reliability function of Burnashev to include cost constraints. The results are generalized to a class of discrete-time memoryless channels with arbitrary alphabets, including additive Gaussian noise channels with amplitude and power constraints.
Subject Keywords
Library and Information Sciences
,
Information Systems
,
Computer Science Applications
URI
https://hdl.handle.net/11511/57705
Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
DOI
https://doi.org/10.1109/tit.2007.915913
Collections
Department of Electrical and Electronics Engineering, Article
Suggestions
OpenMETU
Core
Error Exponents for Variable-length block codes with feedback and cost constraints
Nakiboğlu, Barış; Win, Moe Z (2006-12-26)
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...
Sampling of the Wiener Process for Remote Estimation Over a Channel With Random Delay
Sun, Yin; Polyanskiy, Yury; Uysal, Elif (Institute of Electrical and Electronics Engineers (IEEE), 2020-02-01)
In this paper, we consider a problem of sampling a Wiener process, with samples forwarded to a remote estimator over a channel that is modeled as a queue. The estimator reconstructs an estimate of the real-time signal value from causally received samples. We study the optimal online sampling strategy that minimizes the mean square estimation error subject to a sampling rate constraint. We prove that the optimal sampling strategy is a threshold policy, and find the optimal threshold. This threshold is determ...
Computation of term/document discrimination values by use of the cover coefficient concept
Can, Fazlı; Özkarahan, Esen A. (Wiley, 1987-5)
Indexing in information retrieval (IR) is used to obtain a suitable vocabulary of index terms and optimum assignment of these terms to documents for increasing the effectiveness and efficiency of an IR system. The concept of term discrimination value (TDV) is one of the criteria used for index‐term selection. In this article a new concept called the cover coefficient (CC) will be used in computing TDVs. After a brief introduction to the theory of indexing and the CC concept, an efficient way of computing TD...
Semantic information-based alternative plan generation for multiple query optimization
Polat, Faruk; Alhajj, R (Elsevier BV, 2001-09-01)
This paper addresses the impact of semantic information about queries on alternative plan generation (APG) for multiple query optimization (MQO). MQO covers optimizing the execution of a set of queries together where each query in the set to be optimized has several alternative execution plans. A multiple query optimizer selects an alternative plan for each query to obtain an optimal global execution plan. Our approach uses information such as common relations, common possible joins and common conditions to...
Effective feature reduction for link prediction in location-based social networks
Bayrak, Ahmet Engin; Polat, Faruk (SAGE Publications, 2019-10-01)
In this study, we investigated feature-based approaches for improving the link prediction performance for location-based social networks (LBSNs) and analysed their performances. We developed new features based on time, common friend detail and place category information of check-in data in order to make use of information in the data which cannot be utilised by the existing features from the literature. We proposed a feature selection method to determine a feature subset that enhances the prediction perform...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
B. Nakiboğlu, “Error exponents for variable-length block codes with feedback and cost constraints,”
IEEE TRANSACTIONS ON INFORMATION THEORY
, pp. 945–963, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57705.