Constrained systems for flash memories
Speaker: Dr. Akiko Manada (University of Electro-Communications, Tokyo)
Time: 4:00pm
Date: Monday 11th November 2013
Location: CASL Seminar Room, Block 8, Belfield Office Park
Abstract:
In data storage media, such as CDs or DVDs, some noise patters can be anticipatable, and constrained codes have been applied in order to decrease the likelihood of errors due to the noise. In 2011, Berman and Brik discussed some noise patterns for flash memories and constrained codes which forbid the appearance of sequences affected by the noise. Their argument is interesting and seems to be practical, but unfortunately, their argument have some serious flaws to be corrected. In this talk, we reanalyze suggested constrained codes from the perspective of finite type constrained systems, which have strong relationships with graph theory, in order to propose correct results for their argument. We further introduce some properties on Shannon covers of those constrained systems.
Social Media Links