2 problems

0 votes0 replies0 views
Conjecture on equivalence of the distance-minimization and information-density bounds
The minimum-distance decoding quantities $S_{j,n}$ , $V_{1,n}$ , and $V_{2,n}$ are defined from the distances between codewords and channel outputs, and the stopping time is determin…
Conjectureopenchannel-coding information-theory variable-length-codingarXiv posted 2 days ago
0 votes0 replies0 views
Upper-bound conjecture for MaxEJS expected blocklength via a genie-aided decoder
MaxEJS blocklength upper-bound conjecture. The expected blocklength satisfies
Conjectureopenbinary-symmetric-channel information-theory variable-length-codingarXiv posted 2 days ago

Conjecture on equivalence of the distance-minimization and information-density bounds