On the design and alphabet size of Roth-Skachek nearly MDS expander codes

Authors:
Marc A. Armand
Affiliations:
Department of Electrical & Computer Engineering, National University of Singapore, Singapore
Venue:
MATH'08 Proceedings of the 13th WSEAS international conference on Applied mathematics
Year:
2008

Citing 3
Cited 0

Linear-time encodable and decodable error-correcting codes

IEEE Transactions on Information Theory - Part 1
Linear-time encodable/decodable codes with near-optimal rate

IEEE Transactions on Information Theory
Improved Nearly-MDS Expander Codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, Roth and Skachek presented an expander-based code construction which, by an appropriate choice of constituent code parameters, yields linear-time encodable and decodable codes that lie within an Ε away from the Singleton bound and have an alphabet of size 2O((log 1/Ε)/Ε3) where Ε 0 is sufficiently small. We (i) show that the set of constituent code parameters chosen by Roth and Skachek is not completely correct, (ii) resolve the discrepancies in their work, and (iii) show that an asymptotic reduction in the alphabet size may be obtained for their linear-time decodable codes for rates nearly 1.