| Project/Area Number |
08650432
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
情報通信工学
|
|---|
| Research Institution | The University of Tokushima |
|---|
Principal Investigator |
MORII Masakatu The University of Tokushima, Faculty of Engineering Professor, 工学部, 教授 (00220038)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
MOHRI Masami Kagawa Junior College Research Associate, 助手 (50281697)
|
|---|
| Project Period (FY) |
1996 – 1997
|
| Project Status |
Completed (Fiscal Year 1997)
|
| Budget Amount *help |
¥1,800,000 (Direct Cost: ¥1,800,000)
Fiscal Year 1997: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 1996: ¥1,100,000 (Direct Cost: ¥1,100,000)
|
|---|
| Keywords | coding theory / decoding / Reed-Solomon code / weight distribution / best code |
|---|
| Research Abstract |
1. A class of linear code is very important as practical and theoretical points of view. For discussing the error performance analysis, we need the minimum distance. However it is hard to compute the minimum distance when the linear code has a great many codewords. An efficient algorithm of computing the minimum distance of linear code is presented. The method is based upon the searching tree and using the property of parity check matrix for linear code.
2. A study of constructing the best code, contain more codewords than any previously known codes of same length and minimum distance, is being continued steadily. A method for constructing good linear code is presented. It is based upon in some properties of parity check matrices and help of a computer search.
3. Shortened Reed-Solomon (RS) codes are practically important class of error correcting codes. However reports of this type of research have apparently not been published to date. The shortened RS code and its decoding algorithm which is extended to correct more errors than indicated by the BCH are discussed.bounds.
|
