Coding for channels with cost constraints

DOI10.1109/18.490550MaRDI QIDQ4887063zbMATH OpenOpenAlexFDO

Authors Ali S. Khayrallah, David L. Neuhoff

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.490550

zbMATH Keywords

channel modelfinite-state code

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Shaping codes constructed from cost-constrained graphs
• scientific article; zbMATH DE number 2104030
• Construction of Bounded Delay Codes for Discrete Noiseless Channels
• The construction of M-ary (d,∞) codes that achieve capacity and have the fewest number of encoder states

Cited in

(7)

• Channels With Cost Constraints: Strong Converse and Dispersion
• State splitting for variable-length graphs (Corresp.)
• Computation of channel capacity based on self-concordant functions
• Shaping codes constructed from cost-constrained graphs
• On the cost of worst case coding length constraints
• scientific article; zbMATH DE number 2104030 (Why is no real title available?)
• Maximizing entropy with an expectation constraint and one-parameter exponential families of distributions: a reexamination

This page was built for publication: Coding for channels with cost constraints

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