Amaael Antonini

Orcid: 0009-0006-2811-3711

According to our database1, Amaael Antonini authored at least 11 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Achievable Rates for Low-Complexity Posterior Matching Over the Binary Symmetric Channel.
IEEE Trans. Inf. Theory, August, 2024

Feedback Communication Over the BSC with Sparse Feedback times and Causal Encoding.
CoRR, 2024

Complementary Exclusion of Full Polynomials to Enable Dual List Decoding of Convolutional Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Achievable Rates and Low-Complexity Encoding of Posterior Matching for the BSC.
CoRR, 2023

ELF Codes: Concatenated Codes with an Expurgating Linear Function as the Outer Code.
Proceedings of the 12th International Symposium on Topics in Coding, 2023

Suppressing Error Floors in SCPPM via an Efficient CRC-aided List Viterbi Decoding Algorithm.
Proceedings of the 12th International Symposium on Topics in Coding, 2023

2022
Sequential Transmission Over Binary Asymmetric Channels With Feedback.
IEEE Trans. Inf. Theory, 2022

Neural Normalized Min-Sum Message-Passing vs. Viterbi Decoding for the CCSDS Line Product Code.
Proceedings of the IEEE International Conference on Communications, 2022

2021
Causal (Progressive) Encoding over BinarySymmetric Channels with Noiseless Feedback.
CoRR, 2021

Causal (Progressive) Encoding over Binary Symmetric Channels with Noiseless Feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Low Complexity Algorithms for Transmission of Short Blocks over the BSC with Full Feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2020


  Loading...