An enumerative method for runlength-limited codes: permutation codes
From MaRDI portal
Publication:4503395
DOI10.1109/18.782173zbMath0959.94032OpenAlexW2149131136MaRDI QIDQ4503395
Suparna Datta, Steven W. McLaughlin
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/14327e2731bd590d7e54ac15a764c0f31b33d8e8
Related Items (3)
Quantization of high dimensional Gaussian vector using permutation modulation with application to information reconciliation in continuous variable QKD ⋮ 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: An enumerative method for runlength-limited codes: permutation codes