| Presentation | 2010-03-05 Constructions of A Large Class of Optimum Linear Codes for Small Number of Information Symbols Masao KASAHARA, Shigeichi HIRASAWA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | A new method of constructing efficient codes on the basis of (u,u+v) construction is presented. We present a large class of optimum linear codes for small number of inforamtion symbols. Namely we present (3(2^m-1),m+1,3・2^m-2) code, (3(2^m-1)+1,m+1,3・2^m-1) code and (3(2^m-1)+2,m+1,3・2^m) code respectively. We show that these codes meet the bound of linear codes (m≦6) due to Brouwer and Verfoeff. It is strongly conjectured that, for m>6, our codes meet the bound for any code-length. We then present the (n,2,d) codes that meet the bound of any linear code of length n≦125. It is strongly conjectured that the proposed (n,2,d) codes meet the bound of optimum linear code of any code length. We also present the (n,3,d) code that meet the bound of any linear code of length n except n=8+7μ for n≦60. It is strongly conjectured that our (n,3,d) code meet the bound for any code length except m=8+7μ(μ=1, 2,…). Finally we present several optimum linear codes for the number of information symbols k=4,5,6 and 7. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Efficient code / Binary linear code / Minimun distance bound / (u,u+v) construction |
| Paper # | IT2009-137,ISEC2009-145,WBS2009-116 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 2010/2/25(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 Security (ISEC) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Constructions of A Large Class of Optimum Linear Codes for Small Number of Information Symbols |
| Sub Title (in English) | |
| Keyword(1) | Efficient code |
| Keyword(2) | Binary linear code |
| Keyword(3) | Minimun distance bound |
| Keyword(4) | (u,u+v) construction |
| 1st Author's Name | Masao KASAHARA |
| 1st Author's Affiliation | Faculty of Informatics, Osaka Gakuin University() |
| 2nd Author's Name | Shigeichi HIRASAWA |
| 2nd Author's Affiliation | Waseda University |
| Date | 2010-03-05 |
| Paper # | IT2009-137,ISEC2009-145,WBS2009-116 |
| Volume (vol) | vol.109 |
| Number (no) | 445 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |