Toward a timed theory of channel coding

DOI10.1007/978-3-642-33365-1_4MaRDI QIDQ4649384zbMATH OpenOpenAlexFDO

Authors Eugene Asarin, Nicolas Basset, Marie-Pierre Béal, Aldric Degorre, Dominique Perrin

Publication date 21 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://hal-upec-upem.archives-ouvertes.fr/hal-00793143/file/FORMATS12.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Recommendations

• Volume and entropy of regular timed languages: analytic approach
• Volume and Entropy of Regular Timed Languages: Discretization Approach
• Entropy of regular timed languages
• Codes circulaires, automates locaux et entropie
• Timed symbolic dynamics

Cited in

(11)

• Bounded delay timed channel coding
• Entropy of regular timed languages
• A maximal entropy stochastic process for a timed automaton
• Timed symbolic dynamics
• Sending Perishable Information: Coding Improves Delay-Constrained Throughput Even for Single Unicast
• Optimal Dynamic Coding-Window Selection for Serving Deadline-Constrained Traffic Over Time-Varying Channels
• scientific article; zbMATH DE number 2129913 (Why is no real title available?)
• scientific article; zbMATH DE number 3700721 (Why is no real title available?)
• From Winner-Takes-All to Winners-Share-All: Exploiting the Information Capacity in Temporal Codes
• Bandwidth of timed automata: 3 classes
• Weighing obese timed languages

This page was built for publication: Toward a timed theory of channel coding

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