Please use this identifier to cite or link to this item: https://idr.l3.nitk.ac.in/jspui/handle/123456789/11498
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, H.-
dc.contributor.authorShripathi, Acharya U.-
dc.contributor.authorShetty, K.-
dc.contributor.authorShankarananda, B.-
dc.date.accessioned2020-03-31T08:31:33Z-
dc.date.available2020-03-31T08:31:33Z-
dc.date.issued2012-
dc.identifier.citationIETE Journal of Research, 2012, Vol.58, 4, pp.272-278en_US
dc.identifier.urihttps://idr.nitk.ac.in/jspui/handle/123456789/11498-
dc.description.abstractA 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.titleEnhancing the error-correcting capability of imai-kamiyanagi codes for data storage systems by adopting iterative decoding using a parity check treeen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
File Description SizeFormat 
11498.pdf1.75 MBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.