12 problems
- 0 votes0 replies0 views
Uniqueness of close-packing by the radius-one Lee-sphere code
Close-packing uniqueness conjecture. This code is the only case for which a close-packing exists in dimension .
- 0 votes0 replies0 views
Conjecture on the effect of coset-representative choices on intra-set MSED
Conjecture on coset-representative choices. There would be no big difference in performance between different choices of the set of coset representatives or of the mapping within t…
- 0 votes0 replies0 views
Conjecture on removing the lattice-code rate gap with tighter Gaussian bounds
Gap-removal conjecture. This gap can be completely removed with tighter bounds for the variational distance between the discrete and continuous Gaussians.
- 0 votes0 replies0 views
The polynomial-list-size conjecture for lattice codes
Let denote the gap between the list-decoding capacity and the transmission rate. A lattice code is required to operate at rate , and its list si…
- 0 votes0 replies0 views
The lattice list-decoding capacity conjecture
Let measure the gap between the transmission rate and the list decoding capacity of the quadratically constrained adversarial chan…
- 0 votes0 replies1 view
Conjecture on the classification of low-dimensional quasi-perfect lattice codes
For and , consider linear quasi-perfect codes in under the metric, with codes identified up to congruence. The candidate codes are the lattices liste…
- 0 votes0 replies0 views
The mod- transformation error-exponent loss conjecture
A mod- transformation applies receiver scaling followed by reduction modulo a lattice, producing a mod- channel; mutual information and error exponent are compare…
- 0 votes0 replies0 views
Optimal normalized minimum determinant for quaternionic lattice codes in
Let be a lattice in , where the normalized minimum determinant is measured for the lattice code. Optimality conjecture. We conjecture that…
- 0 votes0 replies0 views
The BB-code determinant decay exponent conjecture
BB-code determinant decay conjecture. Asymptotically, for very large , the determinants of the BB-code decay with exponent . The paper gives the bounds…
- 0 votes0 replies0 views
The decoded-vector quadratic-form conjecture
Decoded-vector quadratic-form conjecture. The finally decoded , not only the associated with the strongest consistent Gaussians, minimizes an express…
- 0 votes0 replies0 views
The quadratic-form conjecture for strongest consistent Gaussians
Quadratic-form conjecture. For , the strongest consistent Gaussians likewise relate to an integer vector that minimizes an expression of the form
- 0 votes0 replies0 views
The fading conjecture for non-consistent Gaussian messages
A Gaussian message is consistent when it corresponds to a lattice-point Gaussian of the type analyzed in the decoder's convergence process; the decoder operates at noise conditions…