KiHoLee
3d5a7fc6f3
Unconstrained key training converged to disjoint sparse supports: 99 percent of each users key energy sat on three or four of the sixteen entries, with pairwise disjoint supports and one numerically dead codebook column. That is an orthogonal slot allocation, so the superposition collapsed into OMA and the key space was far smaller than the dense direction the brute-force study assumes. The main configuration is now the structured Walsh-Hadamard family, which is dense, exactly orthogonal, unit modulus, and already the best family in the key-family table. base_keys generalizes to any key length by truncating the next power-of-two Sylvester order, and the key-length sweep keeps only lengths where the truncated rows stay exactly orthogonal, verified numerically. Also fixes the M-PAM energy normalization in oma_ser_keylen, which used sqrt(6g/(M^2-1)) where unit average symbol energy gives A^2=3/(M^2-1); the closed form was 3 dB optimistic and now reproduces a direct Monte Carlo to 1e-5. Results move accordingly: the proposal now stays below OMA at every SNR and reaches 1.52x at key length 64, while the jamming margin falls to 5.5-6.3 dB and the brute-force curve to 0.59 at a million guesses.
7 lines
284 B
CSV
7 lines
284 B
CSV
scheme,legit_ser,eve_out,eve_in,jam0_ser
|
|
proposed,0.257845,1,0.9999775,0.7719425
|
|
public_mask,0.257845,0.257845,0.257845,0.91675
|
|
perm_key,0.2580675,0.99999,0.2580675,0.7721175
|
|
index_cipher,0.257845,0.9999847412,0.9999847412,0.91675
|
|
oma_plain,0.2747696909,0.2747696909,0.2747696909,nan
|