One Approach on Improved Communication Secrecy

We enhance wireless communication secrecy by embedding a novel fixed-weight masking layer into algebraic error-correcting codes, forcing any eavesdropper to solve a Nearest Codeword Problem with high-weight error while legal receivers remove the mask with a single XOR. We follow a formal channel model that distinguishes legal users from adversaries and show that the fixed-weight mask preserves structural secrecy even against passive eavesdropper attack. Closed-form equivocation bounds are derived. We define and prove the upper bound of the attacker's success probability. Our research confirms negligible secrecy-capacity loss and sub-µs encoding latency as well as DoS attack protection due to the nature of the design.