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 ℓ...

Full description

Saved in:
Bibliographic Details
Published in:Designs, codes, and cryptography Vol. 92; no. 12; pp. 4247 - 4277
Main Authors: Sasidharan, Birenjith, Viterbo, Emanuele, Dau, Son Hoang
Format: Journal Article
Language:English
Published: New York Springer US 01.12.2024
Springer Nature B.V
Subjects:
Algorithms
Binomial coefficients
Codes
Coding
Coding and Information Theory
Complexity
Computer Science
Construction
Cryptology
Decoding
Discrete Mathematics in Computer Science
Integers
Parameter modification
Upper bounds
Enumerative coding
94B15
Nonlinear codes
94B25
94B35
Cyclic-gap code
94A29
Constant weight codes
Binary codes
68P30
Low complexity
ISSN:0925-1022, 1573-7586
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 ℓ , d = 2 ) constant weight code C [ ℓ ] of weight ℓ by encoding information in the gaps between successive 1’s of a vector, and call them as cyclic-gap constant weight codes. The code is associated with a finite integer sequence of length ℓ satisfying a constraint defined as anchor-decodability that is pivotal to ensure low complexity for encoding and decoding. The time complexity of the encoding algorithm is linear in the input size k , and that of the decoding algorithm is poly-logarithmic in the input size n , discounting the linear time spent on parsing the input. Both the algorithms do not require expensive computation of binomial coefficients, unlike the case in many existing schemes. Among codes generated by all anchor-decodable sequences, we show that C [ ℓ ] has the maximum size with k ℓ ≥ ℓ 2 - ℓ log 2 ℓ + log 2 ℓ - 0.279 ℓ - 0.721 . As k is upper bounded by ℓ 2 - ℓ log 2 ℓ + O ( ℓ ) information-theoretically, the code C [ ℓ ] is optimal in its size with respect to two higher order terms of ℓ . In particular, k ℓ meets the upper bound for ℓ = 3 and one-bit away for ℓ = 4 . On the other hand, we show that C [ ℓ ] is not unique in attaining k ℓ by constructing an alternate code C ^ [ ℓ ] again parameterized by an integer ℓ ≥ 3 with a different low-complexity decoder, yet having the same size 2 k ℓ when 3 ≤ ℓ ≤ 7 . Finally, we also derive new codes by modifying C [ ℓ ] that offer a wider range on blocklength and weight while retaining low complexity for encoding and decoding. For certain selected values of parameters, these modified codes too have an optimal k .
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-1022
1573-7586
DOI:10.1007/s10623-024-01494-8