Lossiness of communication channels modeled by transducers1

DOI10.3233/COM-150050zbMATH Open1369.94012OpenAlexW2592287474MaRDI QIDQ5283445FDOQ5283445

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

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

zbMATH Keywords

automatatransducersShannon information

Mathematics Subject Classification ID

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

Cites Work

• Elements of Information Theory
• A theory of timed automata
• On the valuedness of finite transducers
• Pushdown timed automata: A binary reachability characterization and safety verification.
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finite state languages
• The complexity of decision problems for finite-turn multicounter machines
• Title not available (Why is that?)
• Volume and Entropy of Regular Timed Languages: Discretization Approach
• Similarity in languages and programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mathematical Foundations of Computer Science 2003
• On the entropy of context-free languages
• The noncomputability of the channel capacity of context-sensitive languages
• Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach
• A note on finite-valued and finitely ambiguous transducers
• Sampling automata and programs

Cited In (1)

• Lossiness of Communication Channels Modeled by 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)