NDLI: On the poset structure of floating codes

Content Provider	IEEE Xplore Digital Library
Author	Shrestha, M. Lihao Xu
Copyright Year	2013
Description	Author affiliation: Dept. of Comput. Sci., Wayne State Univ., Detroit, MI, USA (Shrestha, M.; Lihao Xu)
Abstract	Flash memory is a non-volatile, non-mechanical data storage technology that stores data by trapping charge and can be reused by freeing the trapped charge with an internal erase operation. When flash memory cells are erased, there is a considerable negative impact on the longevity and performance of the device. To defer and minimize these erasures, a floating code is able to store variable updates as cell increments. A (n, q, k) floating code uses an array of n cells with q levels to store k binary variables. In this paper, we investigate the poset (partially ordered sets) structures derived from the various states of the n cells and k variables. These posets have fundamentally different structures that makes designing floating codes a challenge, most notably their structure of their vertex covers. Based on the poset structure, we present a new floating code for l = 2 and arbitrary q, k and n ∈ {k, k+1}, or arbitrary n, q and k = 2 that is optimal for single cell increments and has a deficiency of O(qk), the best possible deficiency. We present an algorithm for constructing the floating code and prove that the algorithm produces a valid floating code.
Sponsorship	IEEE Cont. Syst. Soc.
Starting Page	621
Ending Page	628
File Size	1188805
Page Count	8
File Format	PDF
e-ISBN	9781479934102
DOI	10.1109/Allerton.2013.6736583
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-10-02
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vectors
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The packing radius of a code and partitioning problems: The case for poset metrics

Translation association schemes, poset metrics, and the shape enumerator of codes

A Subgroup of the Full Poset-Isometry Group

The poset metrics that allow binary codes of codimension m to be m-, (m - 1)-, or (m - 2)-perfect

Linear ordered codes, shape enumarators and parallel channels

Classification of Poset-Block Spaces Admitting MacWilliams-Type Identity

The poset metrics that allow binary codes of codimension m (705).

In error-correcting codes, finite geometries, and cryptography, ser. Contemporary.

Lower bounds on the error probability of turbo codes

On the poset structure of floating codes

Similar Documents

The packing radius of a code and partitioning problems: The case for poset metrics

Translation association schemes, poset metrics, and the shape enumerator of codes

A Subgroup of the Full Poset-Isometry Group

The poset metrics that allow binary codes of codimension m to be m-, (m - 1)-, or (m - 2)-perfect

Linear ordered codes, shape enumarators and parallel channels

Classification of Poset-Block Spaces Admitting MacWilliams-Type Identity

The poset metrics that allow binary codes of codimension m (705).

In error-correcting codes, finite geometries, and cryptography, ser. Contemporary.

Lower bounds on the error probability of turbo codes

On the poset structure of floating codes