Structured iteratively decodable codes based on steiner systems and their application in magnetic recording

Research output: Contribution to conferencePaper

41 Scopus citations

Abstract

This paper introduces a combinatorial construction of a class of iteratively decodable codes, an approach diametrically opposed to the prevalent practice of using large, random-like codes. Our codes are well-structured and, unlike random codes, can lend themselves to a very low complexity implementation. A systematic way of constructing codes based on Steiner systems and the Zv, group is presented, and a hardware efficient encoding algorithm is proposed. A substantial performance improvement of high-rate Steiner codes over the existing schemes used in magnetic recording systems is demonstrated.

Original languageEnglish (US)
Pages2954-2960
Number of pages7
StatePublished - Dec 1 2001
EventIEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States
Duration: Nov 25 2001Nov 29 2001

Other

OtherIEEE Global Telecommunicatins Conference GLOBECOM'01
CountryUnited States
CitySan Antonio, TX
Period11/25/0111/29/01

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Fingerprint Dive into the research topics of 'Structured iteratively decodable codes based on steiner systems and their application in magnetic recording'. Together they form a unique fingerprint.

  • Cite this

    Vasic, B. (2001). Structured iteratively decodable codes based on steiner systems and their application in magnetic recording. 2954-2960. Paper presented at IEEE Global Telecommunicatins Conference GLOBECOM'01, San Antonio, TX, United States.