PreprintarXiv licencearXiv
A Continuous Projection Converse and a Weighted Construction for Uniquely Decodable Code Pairs
Abstract
We study the maximum sum rate of uniquely decodable code pairs. A weighted refinement of a complement-gluing construction yields an explicit code of length 672 and sum rate exceeding $1.318639029203$. An iterated projection argument, combined with a conditional entropy estimate and a justified continuous limit, gives an upper bound of $1.480063425539$.
Related
- A Projection Identity for Simplices Sharp Inequalities, Converse Results, and Affine Projections
- On Solving Continuous-Discrete Projection Filters via Sum-of-Squares Relaxation
- A Projection Anderson Acceleration Algorithm for Non-quasi-monotone Variational Inequalities with Hölder Continuous Terms
- Weighted Spline-Expanded Networks with Distributional Balancing for Continuous Treatment Effects
- Safety-Certified Hierarchical Control of DC Microgrids via Continuous Deep Reinforcement Learning and Covariance-Weighted Sliding Mode Synthesis
BibTeX
@misc{yu2026continuous,
title = {{A Continuous Projection Converse and a Weighted Construction for Uniquely Decodable Code Pairs}},
author = {Lei Yu},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.33625},
eprint = {2609.33625},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.33625},
}
RIS
TY - UNPB
TI - A Continuous Projection Converse and a Weighted Construction for Uniquely Decodable Code Pairs
AU - Lei Yu
PY - 2026
DA - 2026/09/27
PB - arXiv
DO - 10.48550/arxiv.2609.33625
UR - https://arxiv.org/abs/2609.33625
AB - We study the maximum sum rate of uniquely decodable code pairs. A weighted refinement of a complement-gluing construction yields an explicit code of length 672 and sum rate exceeding $1.318639029203$. An iterated projection argument, combined with a conditional entropy estimate and a justified continuous limit, gives an upper bound of $1.480063425539$.
ER -