Computer Science – Information Theory
Scientific paper
2006-01-21
Computer Science
Information Theory
Part of this work was presented at the 2004 IEEE Int'l Symposium on Information Theory (ISIT'2004), Chicago, Illinois (June 20
Scientific paper
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that is linear in their code length, and (iii) they have a linear-time bounded-distance decoder. By using a version of the decoder that corrects also erasures, the codes can replace MDS outer codes in concatenated constructions, thus resulting in linear-time encodable and decodable codes that approach the Zyablov bound or the capacity of memoryless channels. The presented construction improves on an earlier result by Guruswami and Indyk in that any rate and relative minimum distance that lies below the Singleton bound is attainable for a significantly smaller alphabet size.
Roth Ron M.
Skachek Vitaly
No associations
LandOfFree
Improved Nearly-MDS Expander Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Improved Nearly-MDS Expander Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Nearly-MDS Expander Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-438270