| Presentation | 2006-05-25 Universal Burst Error Correction(HISC2006) Marc Fossorier, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this paper, it is shown that under very mild assumptions, practically any binary linear block code of length N and dimension K is able to correct any burst of length up to N-K with probability of success P_c=1 for erasures, and any burst of length up to N-K-m with probability of success P_c⥸1-N2^<-m> for errors. In both cases, the decoding is based on identifying a string of zeroes in an extended syndrome corresponding to a particular representation of the parity check matrix of the code and its complexity is O(N^2) binary operations. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | linear block codes / burst error correction |
| Paper # | IT2006-19 |
| Date of Issue |
| Conference Information | |
| Committee | IT |
|---|---|
| Conference Date | 2006/5/18(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Information Theory (IT) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Universal Burst Error Correction(HISC2006) |
| Sub Title (in English) | |
| Keyword(1) | linear block codes |
| Keyword(2) | burst error correction |
| 1st Author's Name | Marc Fossorier |
| 1st Author's Affiliation | Department of Electrical Engineering University of Hawaii() |
| Date | 2006-05-25 |
| Paper # | IT2006-19 |
| Volume (vol) | vol.106 |
| Number (no) | 60 |
| Page | pp.pp.- |
| #Pages | 5 |
| Date of Issue | |