Please use this identifier to cite or link to this item:
http://idr.nitk.ac.in/jspui/handle/123456789/6732
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Rajesh, Shetty, K. | - |
dc.contributor.author | Shripathi, Acharya U. | - |
dc.contributor.author | Prashantha, Kumar, H. | - |
dc.contributor.author | Shankarananda, B. | - |
dc.date.accessioned | 2020-03-30T09:46:03Z | - |
dc.date.available | 2020-03-30T09:46:03Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | 2010 5th International Conference on Industrial and Information Systems, ICIIS 2010, 2010, Vol., , pp.119-124 | en_US |
dc.identifier.uri | https://idr.nitk.ac.in/jspui/handle/123456789/6732 | - |
dc.description.abstract | Flash memories have found extensive application for use in portable storage devices. They have been used for code storage as well as data storage. The storage density associated with these devices has increased tremendously in the past few years. This has necessitated very dense packing of data bits on the device. This gives rise to increased Raw Bit Error Rate (RBER) as a result of Inter Symbol Interference (ISI) between bits stored in adjacent cells. This necessitates the use of powerful error control codes to guarantee information integrity. With the increase in density of data storage, the raw bit error rate (RBER) associated with the storage device increases. Error Control Coding (ECC) can be used to reduce the RBER to acceptable values so that these devices can be employed to store information in applications where data corruption is unacceptable. In this paper, we describe the synthesis of BCH codes based on memory models proposed by the semiconductor industry. These codes have better error correcting capability than the codes used in current practice. �2010 IEEE. | en_US |
dc.title | Synthesis of BCH codes for enhancing data integrity in flash memories | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.