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

DOI10.1007/s10623-024-01494-8MaRDI QIDQ6651916

Birenjith Sasidharan, Emanuele Viterbo, Son Hoang Dau

Publication date: 11 December 2024

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

binary codesnonlinear codesconstant weight codeslow complexityenumerative codingcyclic-gap code

Mathematics Subject Classification ID

Cyclic codes (94B15) Combinatorial codes (94B25) Decoding (94B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The coolest way to generate combinations
• On a formula for numbers.
• Upper bounds for constant-weight codes
• Codes on Euclidean spheres
• A new table of constant weight codes
• Optical orthogonal codes-new bounds and an optimal construction
• Lexicographic ordering, ranking and unranking of combinations
• Lower bounds for constant weight codes
• New constructions of optimal cyclically permutable constant weight codes
• Constructions for optimal constant weight cyclically permutable codes and difference families
• Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions
• Constant-Weight and Constant-Charge Binary Run-Length Limited Codes
• Principles of Digital Communication
• An algorithm for source coding
• Enumerative source encoding

This page was built for publication: Binary cyclic-gap constant weight codes with low-complexity encoding and decoding