Reduced-redundancy product codes for burst error correction
نویسندگان
چکیده
منابع مشابه
Reduced-Redundancy Product Codes for Burst Error Correction
In a typical burst-error correction application of a product code of nv nh arrays, one uses an [nh; nh rh] code Ch that detects corrupted rows, and an [nv; nv rv] code Cv that is applied to the columns while regarding the detected corrupted rows as erasures. Although this conventional product code scheme o ers very good error protection, it contains excessive redundancy, due to the fact that th...
متن کاملCodes for Multiple Localized Burst Error Correction
A new construction method for codes correcting multiple localized burst errors is proposed. The codes obtained by this method improve upon codes presented by Larsson in size, while keeping the encoding and decoding complexity low. Like the Larsson codes, the proposed codes are asymptotically optimal when the number of bursts to be corrected is fixed and the correctable burst length grows linear...
متن کاملEfficient Burst Error Correction by Hermitian Codes
Hermitian codes belong to a powerful class of algebraic geometry codes, which allow to correct many independent errors. We show that Hermitian codes can correct many bursts of errors as well. Decoding of a Hermitian (N,K) code over q2 can be reduced to decoding of interleaved extended Reed-Solomon codes. Using this fact, we propose an efficient unique decoding algorithm correcting up to (N −K)/...
متن کاملQuantum Error-Correction Codes on Abelian Groups
We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.
متن کاملHelical Interleaving For Burst Error Correction Enhancement of Turbo Product Codes
1999, Efficient Channel Coding, Inc. Helical Interleaving for Burst Error Correction Enhancement of Turbo Product Codes ECC has developed a helical interleaving technique that increases the burst error correction capability of TPCs. The burst error correction capabilities of the resulting TPCs is quite dramatic. In this note, we provide some simulation results to quantify this for the (4096,32...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1998
ISSN: 0018-9448
DOI: 10.1109/18.681317