By Topic

Capacity equalities in 1-dimensional (d,k)-constrained systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kashyap, N. ; Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA, USA ; Siegel, P.H.

In this paper, we consider the problem of determining when the capacities of distinct 1-dimensional (d,k)-constrained systems can be equal. If we let C(d,k) denote the capacity of a (d, k)-constrained system, then it is known that C(d,2d)=C(d+1,3d+1), and C(d,2d+1)=C(d+1,∞). Repeated application of these two identities also yields the chain of equalities C(1,2)=C(2,4)=C(3,7)=C(4,∞). We show that these are the only equalities possible among the capacities of (d,k)-constrained systems.

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003