default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmaael Antonini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Amaael Antonini
, Rita Gimelshein, Richard D. Wesel:
Achievable Rates for Low-Complexity Posterior Matching Over the Binary Symmetric Channel. IEEE Trans. Inf. Theory 70(8): 5471-5497 (2024)- [c6]Zihan Qu, Amaael Antonini, Wenhui Sui, Eugene Min, Arthur Yang, Richard D. Wesel:
Complementary Exclusion of Full Polynomials to Enable Dual List Decoding of Convolutional Codes. ISIT 2024: 1776-1781 - [i7]Amaael Antonini, Rita Gimelshein, Richard D. Wesel:
Feedback Communication Over the BSC with Sparse Feedback times and Causal Encoding. CoRR abs/2404.09455 (2024) - 2023
- [c5]Amaael Antonini, Wenhui Sui, Brendan Towell, Dariush Divsalar, Jon Hamkins, Richard D. Wesel:
Suppressing Error Floors in SCPPM via an Efficient CRC-aided List Viterbi Decoding Algorithm. ISTC 2023: 1-5 - [c4]Richard D. Wesel, Amaael Antonini, Linfang Wang, Wenhui Sui, Brendan Towell, Holden Grissett:
ELF Codes: Concatenated Codes with an Expurgating Linear Function as the Outer Code. ISTC 2023: 1-5 - [i6]Amaael Antonini, Rita Gimelshein, Richard D. Wesel:
Achievable Rates and Low-Complexity Encoding of Posterior Matching for the BSC. CoRR abs/2303.04392 (2023) - [i5]Richard D. Wesel, Amaael Antonini, Linfang Wang, Wenhui Sui, Brendan Towell, Holden Grissett:
ELF Codes: Concatenated Codes with an Expurgating Linear Function as the Outer Code. CoRR abs/2306.07467 (2023) - 2022
- [j1]Hengjie Yang, Minghao Pan, Amaael Antonini, Richard D. Wesel:
Sequential Transmission Over Binary Asymmetric Channels With Feedback. IEEE Trans. Inf. Theory 68(11): 7023-7042 (2022) - [c3]Jonathan Nguyen, Linfang Wang, Chester Hulse, Sahil Dani, Amaael Antonini, Todd Chauvin, Dariush Divsalar, Richard D. Wesel:
Neural Normalized Min-Sum Message-Passing vs. Viterbi Decoding for the CCSDS Line Product Code. ICC 2022: 2375-2380 - 2021
- [c2]Amaael Antonini, Rita Gimelshein, Richard D. Wesel:
Causal (Progressive) Encoding over Binary Symmetric Channels with Noiseless Feedback. ISIT 2021: 142-147 - [i4]Amaael Antonini, Rita Gimelshein, Richard D. Wesel:
Causal (Progressive) Encoding over BinarySymmetric Channels with Noiseless Feedback. CoRR abs/2104.14062 (2021) - [i3]Jonathan Nguyen, Linfang Wang, Chester Hulse, Sahil Dani, Amaael Antonini, Todd Chauvin, Dariush Divsalar, Richard D. Wesel:
Neural Normalized Min-Sum Message-Passing vs. Viterbi Decoding for the CCSDS Line Product Code. CoRR abs/2111.07959 (2021) - [i2]Hengjie Yang, Minghao Pan, Amaael Antonini, Richard D. Wesel:
Sequential Transmission Over Binary Asymmetric Channels With Feedback. CoRR abs/2111.15042 (2021) - 2020
- [c1]Amaael Antonini, Hengjie Yang, Richard D. Wesel:
Low Complexity Algorithms for Transmission of Short Blocks over the BSC with Full Feedback. ISIT 2020: 2173-2178 - [i1]Amaael Antonini, Hengjie Yang, Richard D. Wesel:
Low Complexity Algorithms for Transmission of Short Blocks over the BSC with Full Feedback. CoRR abs/2001.06035 (2020)
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-12 22:59 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:
