• DocumentCode
    2002229
  • Title

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

  • Author

    Kashyap, Navin ; Siegel, Paul H.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA, USA
  • fYear
    2003
  • fDate
    29 June-4 July 2003
  • Firstpage
    105
  • Abstract
    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.
  • Keywords
    binary sequences; channel capacity; capacity equality; one-dimensional constrained system; Binary sequences; Circuits; Magnetic separation; Optical recording; Polynomials; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2003. Proceedings. IEEE International Symposium on
  • Print_ISBN
    0-7803-7728-1
  • Type

    conf

  • DOI
    10.1109/ISIT.2003.1228119
  • Filename
    1228119