Binary cyclic-gap constant weight codes with low-complexity encoding and decoding

In this paper, we focus on the design of binary constant weight codes that admit low-complexity encoding and decoding algorithms, and that have size M = 2 k so that codewords can conveniently be labeled with binary vectors of length k . For every integer ℓ ≥ 3 , we construct a ( n = 2 ℓ , M = 2 k ℓ...

Ausführliche Beschreibung