Enumerative coding for constant-weight binary sequences with constrained run-length of zeros
type: Item
instance of: scholarly article
title: Enumerative coding for constant-weight binary sequences with constrained run-length of zeros
zbMATH Open document ID: 1025.94009
DOI: 10.1023/A:1022081311171
author: O. F. Kurmaev
published in: Problems of Information Transmission
publication date: 2003-11-20T00:00:00Z
Mathematics Subject Classification ID: 94A29
Mathematics Subject Classification ID: 94A55
zbMATH DE Number: 1930603
zbMATH Keywords: enumerative decoding
zbMATH Keywords: enumerative encoding
zbMATH Keywords: constant-weight sequences
MaRDI profile type: Publication
full work available at URL: a:1022081311171
OpenAlex ID: W47093673
Recommended article: Enumeration of constant-weight run-length limited binary sequences
Recommended article: Constant-Weight and Constant-Charge Binary Run-Length Limited Codes
Recommended article: A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)
Recommended article: Q4428041
Recommended article: Some sequences of optimal constant weight codes
Recommended article: Q4435020
Recommended article: Coding of run-length-limited sequences
Recommended article: Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes
Recommended article: Several classes of binary linear codes and their weight enumerators
Recommended article: Weight enumerators of more irreducible cyclic binary codes
description: scientific article; zbMATH DE number 1930603