Enumerative coding for constant-weight binary sequences with constrained run-length of zeros

DOI10.1023/A:1022081311171zbMath1025.94009OpenAlexW47093673MaRDI QIDQ1812364

O. F. Kurmaev

Publication date: 20 November 2003

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022081311171

zbMATH Keywords

enumerative encodingconstant-weight sequencesenumerative decoding

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Source coding (94A29)

Related Items (2)

Fast enumeration algorithm for words with given constraints on run lengths of ones ⋮ Enumeration of constant-weight run-length limited binary sequences

This page was built for publication: Enumerative coding for constant-weight binary sequences with constrained run-length of zeros