Coding for channels with cost constraints

DOI10.1109/18.490550zbMATH Open0857.94010OpenAlexW2105493537MaRDI QIDQ4887063FDOQ4887063

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

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

zbMATH Keywords

channel modelfinite-state code

Mathematics Subject Classification ID

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

Cited In (5)

• Computation of channel capacity based on self-concordant functions
• State splitting for variable-length graphs (Corresp.)
• Title not available (Why is that?)
• Channels With Cost Constraints: Strong Converse and Dispersion
• On the cost of worst case coding length constraints

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)