2 papers
cs.IT2022
Efficiently Computable Converses for Finite-Blocklength Communication
Felipe Areces, Dan Song, Richard Wesel +1
This paper presents a method for computing a finite-blocklength converse for the rate of fixed-length codes with feedback used on discrete memoryless channels (DMCs). The new conve…
cs.IT2021
Achieving Short-Blocklength RCU bound via CRC List Decoding of TCM with Probabilistic Shaping
Linfang Wang, Dan Song, Felipe Areces +1
This paper applies probabilistic amplitude shaping (PAS) to a cyclic redundancy check (CRC) aided trellis coded modulation (TCM) to achieve the short-blocklength random coding unio…