• DocumentCode
    2383490
  • Title

    Robust two-dimensional run-length limited codes

  • Author

    Lee, Jaejin

  • Author_Institution
    Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
  • fYear
    1994
  • fDate
    1-5 May 1994
  • Firstpage
    1814
  • Abstract
    A new idea of increasing density is two-dimensional run-length limited (RLL) codes which loosen the maximum run-length, k, constraint compared to one dimensional run-length limited (d,k) codes since the maximum run-length constraint is satisfied in a joint manner of all n tracks in parallel. This paper introduces a robust and simple approach to two-dimensional run-length limited (d,k) codes using n-tuple maximum run-length constraints for adapting each number of bad tracks occurring up to n-1 bad tracks in parallel of n tracks. Therefore, this scheme highly reduces the possibility of losing timing signal
  • Keywords
    channel capacity; runlength codes; synchronisation; bad tracks; density; maximum run-length; robust two-dimensional run-length limited codes; timing signal; Concurrent computing; Redundancy; Robustness; Timing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, 1994. ICC '94, SUPERCOMM/ICC '94, Conference Record, 'Serving Humanity Through Communications.' IEEE International Conference on
  • Conference_Location
    New Orleans, LA
  • Print_ISBN
    0-7803-1825-0
  • Type

    conf

  • DOI
    10.1109/ICC.1994.368723
  • Filename
    368723