The Capacity of Count-Constrained ICI-Free Systems

01/10/2019

∙

A Markov chain approach is applied to determine the capacity of a general class of q-ary ICI-free constrained systems that satisfy an arbitrary count constraint.

READ FULL TEXT

The Capacity of Count-Constrained ICI-Free Systems

Constrained Monte Carlo Markov Chains on Graphs

Repeat-Free Codes

An Information-Theoretic Approach for Automatically Determining the Number of States when Aggregating Markov Chains

Steady state availability general equations of decision and sequential processes in Continuous Time Markov Chain models

Estimation of Markov Chain via Rank-constrained Likelihood

Precoding for a Class of Peak-Constrained Dirty Paper Channels with a Discrete State

MCPrioQ: A lock-free algorithm for online sparse markov-chains

The Capacity of Count-Constrained ICI-Free Systems

Related Research

Constrained Monte Carlo Markov Chains on Graphs

Repeat-Free Codes

An Information-Theoretic Approach for Automatically Determining the Number of States when Aggregating Markov Chains

Steady state availability general equations of decision and sequential processes in Continuous Time Markov Chain models

Estimation of Markov Chain via Rank-constrained Likelihood

Precoding for a Class of Peak-Constrained Dirty Paper Channels with a Discrete State

MCPrioQ: A lock-free algorithm for online sparse markov-chains