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 language | English (US) |
|---|---|
| Pages | 2954-2960 |
| Number of pages | 7 |
| State | Published - 2001 |
| Event | IEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States Duration: Nov 25 2001 → Nov 29 2001 |
Other
| Other | IEEE Global Telecommunicatins Conference GLOBECOM'01 |
|---|---|
| Country/Territory | United States |
| City | San Antonio, TX |
| Period | 11/25/01 → 11/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
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS