default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBaris Nakiboglu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Hao-Chung Cheng
, Baris Nakiboglu:
A New Characterization Of Augustin Information And Mean. ISIT 2024: 2538-2543- 2023
- [c13]Hao-Chung Cheng, Baris Nakiboglu:
The Mutual Information In The Vicinity of Capacity-Achieving Input Distributions. ISIT 2023: 2111-2116 - [i16]Hao-Chung Cheng, Baris Nakiboglu:
The Mutual Information In The Vicinity of Capacity-Achieving Input Distributions. CoRR abs/2304.14219 (2023) - 2022
- [c12]Mücahit Furkan Yildiz, Baris Nakiboglu:
Augustin Information Measures on Fading Channels Under Certain Symmetry Hypothesis. ISIT 2022: 3061-3066 - 2021
- [c11]Hao-Chung Cheng, Baris Nakiboglu:
On the Existence of the Augustin Mean. ITW 2021: 1-6 - [i15]Hao-Chung Cheng, Baris Nakiboglu:
On the Existence of the Augustin Mean. CoRR abs/2109.00443 (2021) - 2020
- [j11]Baris Nakiboglu:
The Sphere Packing Bound for Memoryless Channels. Probl. Inf. Transm. 56(3): 201-244 (2020) - [c10]Hao-Chung Cheng, Baris Nakiboglu:
Refined Strong Converse for the Constant Composition Codes. ISIT 2020: 2149-2154 - [i14]Hao-Chung Cheng, Baris Nakiboglu:
Refined Strong Converse for the Constant Composition Codes. CoRR abs/2002.11414 (2020)
2010 – 2019
- 2019
- [j10]Baris Nakiboglu:
The Augustin Capacity and Center. Probl. Inf. Transm. 55(4): 299-342 (2019) - [j9]Baris Nakiboglu:
The Sphere Packing Bound for DSPCs With Feedback à la Augustin. IEEE Trans. Commun. 67(11): 7456-7467 (2019) - [j8]Baris Nakiboglu:
The Sphere Packing Bound via Augustin's Method. IEEE Trans. Inf. Theory 65(2): 816-840 (2019) - [j7]Baris Nakiboglu:
The Rényi Capacity and Center. IEEE Trans. Inf. Theory 65(2): 841-860 (2019) - [c9]Baris Nakiboglu:
A Simple Derivation of the Refined SPB for the Constant Composition Codes. ISIT 2019: 2659-2663 - [i13]Baris Nakiboglu:
A Simple Derivation of the Refined SPB for the Constant Composition Codes. CoRR abs/1904.12780 (2019) - 2018
- [i12]Baris Nakiboglu:
The Augustin Capacity and Center. CoRR abs/1803.07937 (2018) - [i11]Baris Nakiboglu:
The Sphere Packing Bound For Memoryless Channels. CoRR abs/1804.06372 (2018) - [i10]Baris Nakiboglu:
The Sphere Packing Bound for DSPCs with Feedback a la Augustin. CoRR abs/1806.11531 (2018) - 2017
- [c8]Baris Nakiboglu:
The Augustin center and the sphere packing bound for memoryless channels. ISIT 2017: 1401-1405 - [i9]Baris Nakiboglu:
The Augustin Center and The Sphere Packing Bound For Memoryless Channels. CoRR abs/1701.06610 (2017) - 2016
- [i8]Baris Nakiboglu:
Renyi Radius and Sphere Packing Bound: Augustin's Approach. CoRR abs/1608.02424 (2016) - [i7]Baris Nakiboglu:
Augustin's Method - Part II: The Sphere Packing Bound. CoRR abs/1611.06924 (2016) - 2013
- [j6]Baris Nakiboglu, Siva K. Gorantla, Lizhong Zheng, Todd P. Coleman:
Bit-Wise Unequal Error Protection for Variable-Length Block Codes With Feedback. IEEE Trans. Inf. Theory 59(3): 1475-1504 (2013) - 2012
- [j5]Baris Nakiboglu, Lizhong Zheng:
Errors-and-Erasures Decoding for Block Codes With Feedback. IEEE Trans. Inf. Theory 58(1): 24-49 (2012) - 2011
- [b1]Baris Nakiboglu:
Exponential bounds on error probability with Feedback. Massachusetts Institute of Technology, Cambridge, MA, USA, 2011 - [i6]Siva K. Gorantla, Baris Nakiboglu, Todd P. Coleman, Lizhong Zheng:
Multi-layer Bit-wise Unequal Error Protection for Variable Length Blockcodes with Feedback. CoRR abs/1101.1934 (2011) - 2010
- [j4]Robert G. Gallager, Baris Nakiboglu:
Variations on a theme by Schalkwijk and Kailath. IEEE Trans. Inf. Theory 56(1): 6-17 (2010) - [c7]Siva K. Gorantla, Baris Nakiboglu, Todd P. Coleman, Lizhong Zheng:
Bit-wise unequal error protection for variable length blockcodes with feedback. ISIT 2010: 241-245 - [c6]Giacomo Como, Baris Nakiboglu:
Sphere-packing bound for block-codes with feedback and finite memory. ISIT 2010: 251-255
2000 – 2009
- 2009
- [j3]Peter Berlin, Baris Nakiboglu, Bixio Rimoldi, Emre Telatar:
A simple converse of Burnashev's reliability function. IEEE Trans. Inf. Theory 55(7): 3074-3080 (2009) - [j2]Shashi Borade, Baris Nakiboglu, Lizhong Zheng:
Unequal error protection: an information-theoretic perspective. IEEE Trans. Inf. Theory 55(12): 5511-5539 (2009) - [c5]Baris Nakiboglu, Lizhong Zheng:
Upper bounds to error probability with feedback. Allerton 2009: 865-871 - [c4]Baris Nakiboglu, Lizhong Zheng:
Upper bounds to error probability with feedback. ISIT 2009: 1515-1519 - [i5]Baris Nakiboglu, Lizhong Zheng:
Error-and-Erasure Decoding for Block Codes with Feedback. CoRR abs/0903.4386 (2009) - 2008
- [j1]Baris Nakiboglu, Robert G. Gallager:
Error Exponents for Variable-Length Block Codes With Feedback and Cost Constraints. IEEE Trans. Inf. Theory 54(3): 945-963 (2008) - [c3]Baris Nakiboglu, Lizhong Zheng:
Errors-and-erasures decoding for block codes with feedback. ISIT 2008: 712-716 - [c2]Shashi Borade, Baris Nakiboglu, Lizhong Zheng:
some fundamental limits of unequal error protection. ISIT 2008: 2222-2226 - [i4]Shashi Borade, Baris Nakiboglu, Lizhong Zheng:
Unequal Error Protection: Some Fundamental Limits. CoRR abs/0803.2570 (2008) - [i3]Robert G. Gallager, Baris Nakiboglu:
Variations on a theme by Schalkwijk and Kailath. CoRR abs/0812.2709 (2008) - 2006
- [c1]Baris Nakiboglu, Robert G. Gallager, Moe Z. Win:
Error Exponents for Variable-length block codes with feedback and cost constraints. ISIT 2006: 74-78 - [i2]Peter Berlin, Baris Nakiboglu, Bixio Rimoldi, Emre Telatar:
A Simple Derivation of Burnashev's Reliability Function. CoRR abs/cs/0610145 (2006) - [i1]Baris Nakiboglu, Robert G. Gallager:
Error Exponents for Variable-length Block Codes with Feedback and Cost Constraints. CoRR abs/cs/0612097 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
