• DocumentCode
    429732
  • Title

    Enumeration algorithms for constructing (d1, ∞, d2, ∞) run length limited arrays: capacity estimates and coding schemes

  • Author

    Srinivasa, Shayan G. ; McLaughlin, Steven W.

  • Author_Institution
    Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
  • fYear
    2004
  • fDate
    24-29 Oct. 2004
  • Firstpage
    141
  • Lastpage
    146
  • Abstract
    We present two enumeration algorithms for a class of (d1, ∞, d2, ∞) run-length limited (RLL) constrained arrays. Based on the structure of these algorithms, we derive bounds for the maximum information rate of the constraint. We also give encoders and decoders for coded 2D constrained arrays with rates close to the derived bounds.
  • Keywords
    channel capacity; data compression; data structures; decoding; runlength codes; RLL constrained arrays; capacity estimates; coded 2D constrained arrays; coding schemes; decoders; encoders; enumeration algorithms; maximum information rate bounds; run-length limited constrained arrays; Data storage systems; Decoding; Entropy; Holographic optical components; Holography; Information rates; Merging; Random processes; Two dimensional displays; Writing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop, 2004. IEEE
  • Print_ISBN
    0-7803-8720-1
  • Type

    conf

  • DOI
    10.1109/ITW.2004.1405289
  • Filename
    1405289
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=429732