Maximizing the Shannon Capacity of Constrained Systems with Two Constraints

DOI10.1137/S0895480102402757MaRDI QIDQ4443139zbMATH OpenOpenAlexFDO

Authors N. Kashyap

Publication date 8 January 2004

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480102402757

zbMATH Keywords

constrained codesperiodic prefix-synchronized codesShannon capacityshifts of finite type

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Prefix, length-variable, comma-free codes (94A45) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• A note on the Shannon capacity of run-length-limited codes (Corresp.)
• On the capacity of two-dimensional run-length constrained channels
• Constrained Codes as Networks of Relations
• Bounds on the capacity of constrained two-dimensional codes
• Capacity achieving code constructions for two classes of (d,k) constraints

Cited in

(2)

• Rare events, escape rates and quasistationarity: Some Exact formulae
• Topological entropies of a class of constrained systems

This page was built for publication: Maximizing the Shannon Capacity of Constrained Systems with Two Constraints

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