Enumerable multitrack (d, k) block codes

DOI10.1109/18.259664MaRDI QIDQ4307399zbMATH OpenOpenAlexFDO

Authors Edward K. Orcutt, Michael W. Marcellin

Publication date 3 October 1994

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

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

zbMATH Keywords

constrained channelsconstrained codesmultitrack \((d,k)\) block codesrecording codes

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Prefix, length-variable, comma-free codes (94A45) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• A new construction for n-track (d, k) codes with redundancy
• scientific article; zbMATH DE number 4207992
• A new approach to constructing optimal block codes for runlength-limited channels
• Shannon capacity of M-ary redundant multitrack runlength limited codes
• Constructing efficient DC-free runlength-limited block codes for recording channels

Cited in

(5)

• Enumeration, construction and random generation of block codes
• Permutation (d,k) codes: efficient enumerative coding and phrase length distribution shaping
• An Analysis on Optimal Rates of BDB Encoders for RLL and MTR Systems
• Spectral analysis of maximum entropy multitrack modulation codes
• A new construction for n-track (d, k) codes with redundancy

This page was built for publication: Enumerable multitrack (d, k) block codes

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