:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Soop, Oskar, Lember, Jüri
Format:	Preprint
Published:	2025
Subjects:	Computation Information Theory
Online Access:	https://arxiv.org/abs/2507.19338
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Equal Requests are Asymptotically Hardest for Data Recovery
by: Lember, Jüri, et al.
Published: (2024)

Strong consistency of pseudo-likelihood parameter estimator for univariate Gaussian mixture models
by: Lember, Jüri, et al.
Published: (2025)

Viterbi State Selection for Discrete Pinching Antenna Systems
by: Galanopoulou, Victoria E., et al.
Published: (2025)

An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes
by: Abreu, Zita, et al.
Published: (2024)

Application of the List Viterbi Algorithm for Satellite-based AIS Detection
by: Kanaan, Linda, et al.
Published: (2025)

Derivation of Mutual Information and Linear Minimum Mean-Square Error for Viterbi Decoding of Convolutional Codes Using the Innovations Method
by: Tajima, Masato
Published: (2024)

LLM-Viterbi: Semantic-Aware Decoding for Convolutional Codes
by: Li, Zhengtong, et al.
Published: (2026)

Group Vitality Indices: Axioms and Algorithms
by: Kucharczuk, Natalia, et al.
Published: (2026)

Attention with Markov: A Framework for Principled Analysis of Transformers via Markov Chains
by: Makkuva, Ashok Vardhan, et al.
Published: (2024)

Space-bounded online Kolmogorov complexity is additive
by: Bauwens, Bruno, et al.
Published: (2025)

Algorithmic Randomness in Continuous-Time Markov Chains
by: Huang, Xiang, et al.
Published: (2019)

Transformers on Markov Data: Constant Depth Suffices
by: Rajaraman, Nived, et al.
Published: (2024)

Model-Based Reinforcement Learning for Offline Zero-Sum Markov Games
by: Yan, Yuling, et al.
Published: (2022)

An exposition of recent list-size bounds of FRS Codes
by: Garg, Abhibhav, et al.
Published: (2025)

Approximation and bounding techniques for the Fisher-Rao distances between parametric statistical models
by: Nielsen, Frank
Published: (2024)

Identifiability and minimality bounds of quantum and post-quantum models of classical stochastic processes
by: Riechers, Paul M., et al.
Published: (2025)

Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound
by: Li, Songsong, et al.
Published: (2025)

Prediction from compression for models with infinite memory, with applications to hidden Markov and renewal processes
by: Han, Yanjun, et al.
Published: (2024)

A lower bound on the field size of convolutional codes with a maximum distance profile and an improved construction
by: Chen, Zitan
Published: (2023)

A slightly improved upper bound for quantum statistical zero-knowledge
by: Gall, François Le, et al.
Published: (2025)

Computational hardness of estimating quantum entropies via binary entropy bounds
by: Liu, Yupan
Published: (2026)

Abstract Markov Random Fields
by: Lang, Leon, et al.
Published: (2024)

The computational inevitability of life: self-replication under resource-bounded nested algorithmic probability
by: Sarkar, Aritra
Published: (2020)

Explaining Robust Quantum Metrology by Counting Codewords
by: Novak, Oskar, et al.
Published: (2025)

On the relationship between MESP and 0/1 D-Opt and their upper bounds
by: Ponte, Gabriel, et al.
Published: (2025)

Virtual Quantum Markov Chains
by: Chen, Yu-Ao, et al.
Published: (2023)

On noisy duplication channels with Markov sources
by: McBain, Brendon, et al.
Published: (2024)

Proportional Selection in Networks
by: Papasotiropoulos, Georgios, et al.
Published: (2025)

Information Geometry Approach to Parameter Estimation in Hidden Markov Models
by: Hayashi, Masahito
Published: (2017)

An information-theoretic model of shallow and deep language comprehension
by: Li, Jiaxuan, et al.
Published: (2024)

A series of maximum entropy upper bounds of the differential entropy
by: Nielsen, Frank, et al.
Published: (2016)

Information-theoretic generalization bounds for learning from quantum data
by: Caro, Matthias, et al.
Published: (2023)

Geometry and Duality of Alternating Markov Chains
by: Mithal, Deven, et al.
Published: (2024)

Empirical Coordination over Markov Channel with Independent Source
by: Zhao, Mengyuan, et al.
Published: (2026)

Shared Information for a Markov Chain on a Tree
by: Bhattacharya, Sagnik, et al.
Published: (2023)

Decomposition of surprisal: Unified computational model of ERP components in language processing
by: Li, Jiaxuan, et al.
Published: (2024)

FLASH Viterbi: Fast and Adaptive Viterbi Decoding for Modern Data Systems
by: Deng, Ziheng, et al.
Published: (2025)

Linking Microscopic and Macroscopic Models for Evolution: Markov Chain Network Training and Conservation Law Approximations
by: Melnik, Roderick V. N.
Published: (2007)

Constant Weight Polar Codes through Periodic Markov Processes
by: Shuval, Boaz, et al.
Published: (2025)

Resource bounded Kučera-Gács Theorems
by: Nandakumar, Satyadev, et al.
Published: (2026)