DeepAI AI Chat
Log In Sign Up

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

page 1

page 2

page 3

page 4

06/28/2019

Constrained Monte Carlo Markov Chains on Graphs

This paper presents a novel theoretical Monte Carlo Markov chain procedu...
09/12/2019

Repeat-Free Codes

In this paper we consider the problem of encoding data into repeat-free ...
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...
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...
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 ...