DeepAI AI Chat

The Capacity of Count-Constrained ICI-Free Systems

01/10/2019

∙

by Navin Kashyap, et al.

∙

indian institute of science

∙

University of California, San Diego

∙

0

∙

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

Navin Kashyap
24 publications
Ron M. Roth
8 publications
Paul H. Siegel
16 publications

page 1

page 2

page 3

page 4

research

∙ 06/28/2019

Constrained Monte Carlo Markov Chains on Graphs

This paper presents a novel theoretical Monte Carlo Markov chain procedu...

0 Roy Cerqueti, et al. ∙

research

∙ 09/12/2019

Repeat-Free Codes

In this paper we consider the problem of encoding data into repeat-free ...

0 Ohad Elishco, et al. ∙

research

∙ 07/05/2021

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

A fundamental problem when aggregating Markov chains is the specificatio...

0 Isaac J. Sledge, et al. ∙

research

∙ 01/20/2017

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

Continuous Time Markov Chain (CMTC) is widely used to describe and analy...

0 Eduardo M. Vasconcelos, et al. ∙

research

∙ 01/05/2023

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

The dirty paper channel (DPC) under a peak amplitude constraint arises i...

0 Zhenyu Charlus Zhang, et al. ∙

research

∙ 04/28/2023

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

In high performance systems it is sometimes hard to build very large gra...

0 Jesper Derehag, et al. ∙

research

∙ 05/21/2021

Modelling the development of counting with memory-augmented neural networks

Learning to count is an important example of the broader human capacity ...

12 Zack Dulberg, et al. ∙

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

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

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

Modelling the development of counting with memory-augmented neural networks