The Optimization of Random Tree Codes for Limited Computational Resources

2025/01/22 by B. Tan Bacinoglu, Bacinoglu, B. Tan · 1 voice
Biochemistry, Genetics and Molecular Biology · Computer Science · #Advanced Image and Video Retrieval Techniques #Algorithms and Data Compression #DNA and Biological Computing #cs.CC #cs.IT

paper · pdf · doi:10.48550/arxiv.2501.12834

Abstract

In this paper, we introduce an achievability bound on the frame error rate of random tree code ensembles under a sequential decoding algorithm with a hard computational limit and consider the optimization of the random tree code ensembles over their branching structures/profiles and the decoding measure. Through numerical examples, we show that the achievability bound for the optimizated random tree codes can approach the maximum likelihood (ML) decoding performance of pure random codes.

Discussions

• B. Tan Bacinoglu: The Optimization of Random Tree Codes for Limited Computational Resources https://arxiv.org/abs/2501.12834 https://arxiv.org/pdf/2501.12834 https://arxiv.org/html/2501.12834 [bsky, 0 points, 1 comments]

Related

• Efficient Evaluation of the Probability of Error of Random Coding Ensembles
• On the list decodability of random linear codes with large error rates
• A Random Coding Approach to Performance Analysis of the Ordered Statistic Decoding with Local Constraints
• The Random Coding Bound Is Tight for the Average Linear Code or Lattice
• Threshold Rates of Codes Ensembles: Linear is Best