![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Kapil Bhattad
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [j5]Young-Han Nam
, Yosuke Akimoto, Younsun Kim, Moon-il Lee, Kapil Bhattad, Anthony E. Ekpenyong:
Evolution of reference signals for LTE-advanced systems. IEEE Commun. Mag. 50(2): 132-138 (2012) - 2011
- [p1]Alex Gorokhov, Amir Farajidana, Kapil Bhattad, Xiliang Luo, Stefan Geirhofer:
Multiple Antenna Techniques for LTE-Advanced. LTE - The UMTS Long Term Evolution (2nd Ed.) 2011: 651-672 - 2010
- [j4]Kapil Bhattad, Krishna R. Narayanan:
A note on the rate of decay of mean-squared error with SNR for the AWGN channel. IEEE Trans. Inf. Theory 56(1): 332-335 (2010)
2000 – 2009
- 2008
- [b1]Kapil Bhattad:
Joint source channel coding for non-ergodic channels: the distortion signal-to-noise ratio (SNR) exponent perspective. Texas A&M University, College Station, USA, 2008 - [j3]Kapil Bhattad, Krishna R. Narayanan, Giuseppe Caire:
On the Distortion SNR Exponent of Some Layered Transmission Schemes. IEEE Trans. Inf. Theory 54(7): 2943-2958 (2008) - 2007
- [j2]Kapil Bhattad, Krishna R. Narayanan:
An MSE-Based Transfer Chart for Analyzing Iterative Decoding Schemes Using a Gaussian Approximation. IEEE Trans. Inf. Theory 53(1): 22-38 (2007) - [i6]Kapil Bhattad, Vishwambhar Rathi, Rüdiger L. Urbanke:
Degree Optimization and Stability Condition for the Min-Sum Decoder. CoRR abs/0705.1345 (2007) - [i5]Kapil Bhattad, Krishna R. Narayanan, Giuseppe Caire:
On the Distortion SNR Exponent of Some Layered Transmission Schemes. CoRR abs/cs/0703035 (2007) - 2006
- [j1]Kapil Bhattad, Krishna R. Narayanan:
A decision feedback based scheme for Slepian-Wolf coding of sources with hidden Markov correlation. IEEE Commun. Lett. 10(5): 378-380 (2006) - 2005
- [c1]Kapil Bhattad, Niranjan Ratnakar, Ralf Koetter, Krishna R. Narayanan:
Minimal network coding for multicast. ISIT 2005: 1730-1734 - [i4]Krishna R. Narayanan, Kapil Bhattad:
A Decision Feedback Based Scheme for Slepian-Wolf Coding of sources with Hidden Markov Correlation. CoRR abs/cs/0506043 (2005) - [i3]Kapil Bhattad, Niranjan Ratnakar, Ralf Koetter, Krishna R. Narayanan:
Minimal Network Coding for Multicast. CoRR abs/cs/0506044 (2005) - [i2]Krishna R. Narayanan, Kapil Bhattad:
Decision Feedback Based Scheme for Slepian-Wolf Coding of sources with Hidden Markov Correlation. CoRR abs/cs/0506045 (2005) - [i1]Kapil Bhattad, Krishna R. Narayanan:
An MSE Based Ttransfer Chart to Analyze Iterative Decoding Schemes. CoRR abs/cs/0506058 (2005)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint