Efficient Encoding of Binary Constant-Weight Codes: Variable-Length Balancing Schemes à La Knuth

We study and propose schemes that map messages onto constant-weight codewords using variable-length prefixes. We provide polynomial-time computable formulas that estimate the average number of redundant bits incurred by our schemes. In addition to the exact formulas, we also perform an asymptotic an...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2024-07, Vol.70 (7), p.4731-4746
Main Authors: Dao, Duc Tu, Kiah, Han Mao, Nguyen, Tuan Thanh
Format: Article
Language:English
Subjects:
Balanced code
Binary codes
Codes
constant-weight code
constrained code
DNA
Encoding
Error correction
Memory
Messages
Polynomials
Redundancy
Surveys
Transforms
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!