NDLI: Windowed Erasure Codes

Content Provider	IEEE Xplore Digital Library
Author	Studholme, C. Blake, I.
Copyright Year	2006
Description	Author affiliation: Dept. of Comput. Sci., Toronto Univ., Ont. (Studholme, C.)
Abstract	The design of erasure correcting codes and their decoding algorithms is now at the point where capacity achieving codes are available with decoding algorithms that have complexity that is linear in the number of information symbols. One aspect of these codes is that the overhead (number of coded symbols beyond the number of information symbols required to achieve decoding completion with high probability) is linear in k. This work considers a new class of random codes which have the following advantages: (i) the overhead is constant (in the range of 5 to 10) (ii) the probability of completing decoding for such an overhead is essentially one (iii) the codes are effective for a number of information symbols as low as a few tens. The price for these properties is that the decoding complexity is greater, on the order of k $^{3/2}.$ However, for the lower values of k where these codes are of particular interest, this increase in complexity might be outweighed by other significant advantages. The parity check matrices of these codes are chosen at random as windowed matrices i.e. for each column an initial starting position of a window of length w is chosen and the succeeding w positions are chosen at random by zero or one. It can be shown that it is necessary that w = $O(k^{1/2})$ for the probabilistic matrix rank properties to behave as a non-windowed random matrix. The sufficiency of the condition has so far been established by extensive simulation, although other arguments strongly support this conclusion
Starting Page	509
Ending Page	513
File Size	238544
Page Count	5
File Format	PDF
ISBN	142440505X
DOI	10.1109/ISIT.2006.261768
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-07-09
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Decoding Parity check codes Computer science Algorithm design and analysis Internet Feedback File servers Web server Computer crashes Bipartite graph
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

Analysis of the Thresholds for Regular Low-Density Erasure Codes

Windowed erasure decoding of LDPC Convolutional Codes

Architecture-aware low-density parity-check codes

Verification codes for deletions

A scalable architecture for LDPC decoding

Analysis and proof of the stability condition for low-density erasure codes

Low-Density Parity-Check Codes for Discretized Min-Sum Decoding

Assessing the performance of erasure codes in the wide-area

Reliable Distribution of Data Using Replicated Web Servers

Windowed Erasure Codes

Similar Documents

Analysis of the Thresholds for Regular Low-Density Erasure Codes

Windowed erasure decoding of LDPC Convolutional Codes

Architecture-aware low-density parity-check codes

Verification codes for deletions

A scalable architecture for LDPC decoding

Analysis and proof of the stability condition for low-density erasure codes

Low-Density Parity-Check Codes for Discretized Min-Sum Decoding

Assessing the performance of erasure codes in the wide-area

Reliable Distribution of Data Using Replicated Web Servers

Windowed Erasure Codes