Cyclic twodimensional IT reducing codes

Vasić Bane, Milenković Olgica

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Multitrack recording codes achieve larger storage capacities than separately applied single-track codes. Beside the ordinary intratrack (d) and the global (k) phrase length constraints, a radial (dy) constraint should be introduced. In order to increase immunity to intertrack interference by coding, an additional radial (dy) constraint must be imposed on coded sequences. An ordinary dy-constraint would lead to lower recording densities for the inner than for the outer tracks. A modified, cyclic radial constraint which solves these problems is proposed. Channel capacities and spectra of these codes are also presented.

Original languageEnglish (US)
Title of host publicationProceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Number of pages1
DOIs
StatePublished - Dec 1 1997
Externally publishedYes
Event1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany
Duration: Jun 29 1997Jul 4 1997

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other1997 IEEE International Symposium on Information Theory, ISIT 1997
CountryGermany
CityUlm
Period6/29/977/4/97

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Cyclic twodimensional IT reducing codes'. Together they form a unique fingerprint.

  • Cite this

    Bane, V., & Olgica, M. (1997). Cyclic twodimensional IT reducing codes. In Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997 [613351] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.1997.613351