• DocumentCode
    1330763
  • Title

    An entropy theorem for computing the capacity of weakly (d,k)-constrained sequences

  • Author

    Janssen, Augustus J E M ; Immink, Kees A Schouhamer

  • Author_Institution
    Philips Res. Lab., Eindhoven, Netherlands
  • Volume
    46
  • Issue
    3
  • fYear
    2000
  • fDate
    5/1/2000 12:00:00 AM
  • Firstpage
    1034
  • Lastpage
    1038
  • Abstract
    We find an analytic expression for the maximum of the normalized entropy -ΣiεTpiln pi/ΣiεTipi where the set T is the disjoint union of sets Sn of positive integers that are assigned probabilities Pn, ΣnPn =1. This result is applied to the computation of the capacity of weakly (d,k)-constrained sequences that are allowed to violate the (d,k)-constraint with small probability
  • Keywords
    binary sequences; maximum entropy methods; probability; set theory; binary sequence; disjoint set union; entropy theorem; maximum normalized entropy; probabilities; weakly constrained sequences capacity; Capacity planning; Channel capacity; Constraint theory; DVD; Entropy; Equations; Feeds; Information theory; Laboratories; Magnetic recording;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.841180
  • Filename
    841180
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1330763