Regular lattice LDPC codes in perpendicular magnetic recording

Bane V Vasic, Erozan M. Kurtas, Alexander V. Kuznetsov

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


It has been well recognized that random low-density parity check (LDPC) codes perform close to the theoretical limit. However, iterative decoders employed for their decoding have very high complexity and are incapable of operating in the >1 Gbps regime, the expected data rates of the next generation of magnetic recording channels. Efficient regular LDPC codes were proposed by B. Vasic (Proc. Globecom 2001). These codes are based on balanced incomplete block designs (BIBD), known as Steiner systems, and have reduced complexity of the LDPC encoders. In this paper, using integer lattices, we introduce a new class of well structured LDPC codes that have high rates and low hardware complexity, and investigate their performance in perpendicular magnetic recording channels.

Original languageEnglish (US)
Title of host publicationINTERMAG Europe 2002 - IEEE International Magnetics Conference
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)0780373650, 9780780373655
StatePublished - 2002
Event2002 IEEE International Magnetics Conference, INTERMAG Europe 2002 - Amsterdam, Netherlands
Duration: Apr 28 2002May 2 2002


Other2002 IEEE International Magnetics Conference, INTERMAG Europe 2002

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering
  • Surfaces, Coatings and Films


Dive into the research topics of 'Regular lattice LDPC codes in perpendicular magnetic recording'. Together they form a unique fingerprint.

Cite this