Capacity of channels with redundant multitrack (d,k) constraints: the k>d case

DOI10.1109/18.532896MaRDI QIDQ4896834zbMATH OpenOpenAlexFDO

Authors Bane Vasić

Publication date 12 March 1997

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

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

zbMATH Keywords

channel capacitiesmultitrack 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

• Shannon capacity of M-ary redundant multitrack runlength limited codes
• On the capacity of two-dimensional run-length constrained channels
• A new construction for n-track (d, k) codes with redundancy
• Equalities among Capacities of (d,k)-Constrained Systems
• On runlength codes

Cited in

(3)

• Shannon capacity of M-ary redundant multitrack runlength limited codes
• Equalities among Capacities of (d,k)-Constrained Systems
• A new construction for n-track (d, k) codes with redundancy

This page was built for publication: Capacity of channels with redundant multitrack (d,k) constraints: the k>d case

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