Please use this identifier to cite or link to this item:
https://idr.l2.nitk.ac.in/jspui/handle/123456789/11498Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kumar, H. | - |
| dc.contributor.author | Shripathi, Acharya U. | - |
| dc.contributor.author | Shetty, K. | - |
| dc.contributor.author | Shankarananda, B. | - |
| dc.date.accessioned | 2020-03-31T08:31:33Z | - |
| dc.date.available | 2020-03-31T08:31:33Z | - |
| dc.date.issued | 2012 | - |
| dc.identifier.citation | IETE Journal of Research, 2012, Vol.58, 4, pp.272-278 | en_US |
| dc.identifier.uri | https://idr.nitk.ac.in/jspui/handle/123456789/11498 | - |
| dc.description.abstract | A novel low-complexity, soft decision technique which allows the decoding of distance-5 double error-correcting Imai-Kamiyanagi codes by using a parity check tree associated with the Tanner graph is proposed. These codes have been applied to memory subsystems and digital storage devices in order to achieve efficient and reliable data processing and storage. For the AWGN channel, gains in excess of 1.5 dB at reasonable bit error rates with respect to conventional hard decision decoding are demonstrated for the (46, 32), (81, 64), and (148, 128) shortened Imai-Kamiyanagi codes. Copyright 2012 by the IETE. | en_US |
| dc.title | Enhancing the error-correcting capability of imai-kamiyanagi codes for data storage systems by adopting iterative decoding using a parity check tree | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | 1. Journal Articles | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.