Lossiness of communication channels modeled by transducers1

DOI10.3233/COM-150050MaRDI QIDQ5283445zbMATH OpenOpenAlexFDO

Authors Oscar H. Ibarra, Cewei Cui, Zhe Dang, Thomas R. Fischer

Publication date 21 July 2017

Published in Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/com-150050

zbMATH Keywords

automatatransducersShannon information

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Communication theory (94A05)

Recommendations

• Lossiness of Communication Channels Modeled by Transducers
• Capacity of Continuous-Space Electromagnetic Channels With Lossy Transceivers
• scientific article; zbMATH DE number 2038771
• Quantitative analysis of probabilistic lossy channel systems
• Energy-Distortion Exponents in Lossy Transmission of Gaussian Sources Over Gaussian Channels
• To code, or not to code: lossy source-channel communication revisited
• Data Transmission Error Probabilities in the Presence of Low-Frequency Removal and Noise
• Optimal channel choice for lossy data flow transmission
• Communication Channel Capacity with Almost Gaussian Noise
• Simulating perfect channels with probabilistic lossy channels

Cites work

• scientific article; zbMATH DE number 1670769 (Why is no real title available?)
• scientific article; zbMATH DE number 2038746 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 2087219 (Why is no real title available?)
• scientific article; zbMATH DE number 3062467 (Why is no real title available?)
• A note on finite-valued and finitely ambiguous transducers
• A theory of timed automata
• Elements of Information Theory
• Finite state languages
• Information rate of some classes of non-regular languages: an automata-theoretic approach (extended abstract)
• Mathematical Foundations of Computer Science 2003
• On the entropy of context-free languages
• On the valuedness of finite transducers
• Pushdown timed automata: A binary reachability characterization and safety verification.
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Sampling automata and programs
• Similarity in languages and programs
• The complexity of decision problems for finite-turn multicounter machines
• The noncomputability of the channel capacity of context-sensitive languages
• Volume and Entropy of Regular Timed Languages: Discretization Approach

Cited in

(2)

• Lossiness of Communication Channels Modeled by Transducers
• Channel synthesis for finite transducers

This page was built for publication: Lossiness of communication channels modeled by transducers1

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