Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDan Song 0009
Person information
- affiliation: Stanford University, Department of Electrical Engineering, CA, USA
- affiliation: University of California, Los Angeles, UCLA, Department of Electrical and Computer Engineering, CA, USA
Other persons with the same name
- Dan Song — disambiguation page
- Dan Song 0001 — Chosun University, Department of Computer Science, Gwangju, Korea
- Dan Song 0002 — ChyronHego Tracab, Stockholm, Sweden (and 2 more)
- Dan Song 0003 — Northeastern University, Sino-Dutch Biomedical and Information Engineering School, Shenyang, China
- Dan Song 0004
![[0000-0003-2844-4351]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-2844-4351")
— Tianjin Polytechnic University, College of Electrical Engineering and Automation, China (and 1 more) - Dan Song 0005 — McMaster University, Department of Electrical and Computer Engineering, Hamilton, ON, Canada
- Dan Song 0006 — Tianjin University, School of Electrical and Information Engineering, China (and 1 more)
- Dan Song 0007 — Xi'an University of Architecture and Technology, School of Management, China
- Dan Song 0008 — Xiamen University, Department of Information and Communication Engineering, China (and 1 more)
- Dan Song 0010 — University of Electronic Science and Technology of China, Zhongshan Institute, Artificial Intelligence and Computer Vision Laboratory, China (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j2]Linfang Wang, Dan Song, Felipe Areces, Thomas Wiegart, Richard D. Wesel:
Probabilistic Shaping for Trellis-Coded Modulation With CRC-Aided List Decoding. IEEE Trans. Commun. 71(3): 1271-1283 (2023)- 2022
- [j1]Alexander M. Baldauf, Adam Belhouchat, Shakeh Kalantarmoradian, Alethea Sung-Miller, Dan Song, Nathan Wong, Richard D. Wesel:
Efficient Computation of Viterbi Decoder Reliability With an Application to Variable-Length Coding. IEEE Trans. Commun. 70(9): 5711-5723 (2022) - [c4]Dan Song, Felipe Areces, Linfang Wang, Richard D. Wesel:
Shaped TCM with List Decoding that Exceeds the RCU Bound by Optimizing a Union Bound on FER. GLOBECOM 2022: 4262-4267 - [c3]Linfang Wang, Dan Song, Felipe Areces, Richard D. Wesel:
Achieving Short-Blocklength RCU Bound via CRC List Decoding of TCM with Probabilistic Shaping. ICC 2022: 2906-2911 - [c2]Felipe Areces, Dan Song, Richard D. Wesel, Aaron B. Wagner:
Efficiently Computable Converses for Finite-Blocklength Communication. ISIT 2022: 2094-2099 - [i2]Felipe Areces, Dan Song, Richard D. Wesel, Aaron B. Wagner:
Efficiently Computable Converses for Finite-Blocklength Communication. CoRR abs/2202.04267 (2022) - 2021
- [i1]Linfang Wang, Dan Song, Felipe Areces, Richard D. Wesel:
Achieving Short-Blocklength RCU bound via CRC List Decoding of TCM with Probabilistic Shaping. CoRR abs/2111.08756 (2021) - 2020
- [c1]Derek Xiao, Linfang Wang, Dan Song, Richard D. Wesel:
Finite-Support Capacity-Approaching Distributions for AWGN Channels. ITW 2020: 1-5
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-07-24 20:46 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:
