Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

The Optimization of Random Tree Codes for Limited Computational Resources ...

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ أكثر حفظ في قائمتي
  • معلومة اضافية
    • بيانات النشر:
      arXiv
    • الموضوع:
      2025
    • Collection:
      DataCite Metadata Store (German National Library of Science and Technology)
    • نبذة مختصرة :
      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. ...
    • الرقم المعرف:
      10.48550/arxiv.2501.12834
    • الدخول الالكتروني :
      https://dx.doi.org/10.48550/arxiv.2501.12834
      https://arxiv.org/abs/2501.12834
    • Rights:
      Creative Commons Attribution 4.0 International ; https://creativecommons.org/licenses/by/4.0/legalcode ; cc-by-4.0
    • الرقم المعرف:
      edsbas.25F5FC61