Algorithms to enumerate codewords for DC/sup 2/-constrained channels

DOI10.1109/18.959281zbMATH Open1018.94012OpenAlexW2102086743MaRDI QIDQ4544747FDOQ4544747

Authors Yan Xin, Ivan J. Fair 

Publication date 4 August 2002

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.959281

zbMATH Keywords

enumerationline coding\(\text{DC}^2\)-constrained channels

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Partitions of sets (05A18) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• scientific article; zbMATH DE number 3891247
• Efficient code constructions for certain two-dimensional constraints
• A practical method for approaching the channel capacity of constrained channels
• Coding of run-length-limited sequences
• Fast enumeration algorithm for words with given constraints on run lengths of ones

Cited in

(1)

• Error propagation assessment of enumerative coding schemes

This page was built for publication: Algorithms to enumerate codewords for DC/sup 2/-constrained channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544747)