| Presentation | 2014-05-16 A Lower Bound on Asymptotic Distance Ratio of Product Codes and Constructive Asymptotically Good Product Codes Toshihisa NISHIJIMA, Kin-ichiroh TOKIWA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | It is well known that the Gilbert-Varshamov lower bound is the lower bound on distance ratio of the binary linear block codes for any rates. However, until now, no one has found a constructive binary linear block code meeting this bound. On the other hand, it is also well known that the Zyablov lower bound is the lower bound on distance ratio of the binary concatenated codes for any rates. The constructive binary concatenated codes meeting this bound for any rates and beyond this bound for some region of high rates have been found by B. Z. Shen and by Y. Sugiyama et al.. But these arguments for binary product codes with the two dimensional construction like binary concatenated codes are not discussed in the literature. Then, first, we show a lower bound on distance ratio of binary product codes. Furthermore, by utilizing the constructive asymptotically good concatenated codes having the best ability of we know ones, we encode some constructive asymptotically good product codes and compare the ability of these codes with that lower bound of product codes. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | product codes / asymptotic distance ratio / concatenated codes / Gilbert-Varshamov lower bound / Zyablov lower bound / asymptotically good codes |
| Paper # | IT2014-6 |
| Date of Issue |
| Conference Information | |
| Committee | IT |
|---|---|
| Conference Date | 2014/5/9(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) | A Lower Bound on Asymptotic Distance Ratio of Product Codes and Constructive Asymptotically Good Product Codes |
| Sub Title (in English) | |
| Keyword(1) | product codes |
| Keyword(2) | asymptotic distance ratio |
| Keyword(3) | concatenated codes |
| Keyword(4) | Gilbert-Varshamov lower bound |
| Keyword(5) | Zyablov lower bound |
| Keyword(6) | asymptotically good codes |
| 1st Author's Name | Toshihisa NISHIJIMA |
| 1st Author's Affiliation | Faculty of Computer and Information Sciences, Hosei University() |
| 2nd Author's Name | Kin-ichiroh TOKIWA |
| 2nd Author's Affiliation | Faculty of Engineering, Osaka Sangyo University |
| Date | 2014-05-16 |
| Paper # | IT2014-6 |
| Volume (vol) | vol.114 |
| Number (no) | 34 |
| Page | pp.pp.- |
| #Pages | 4 |
| Date of Issue | |