Presentation | 2003/4/17 Computer search for best convoluitonal codes Hiroshi SASANO, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | It is well known that no method exists for finding best convolutional codes except for computer search. In a computer search, the number of codes to be examined increases exponentially with memory length. We show a method of searching for the best convolutional codes using several computers in parallel and some results of the search for the codes of various code parameters. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | convolutional code / best code / computer search / weight spectraum |
Paper # | SAT2003-6,A・P2003-6 |
Date of Issue |
Conference Information | |
Committee | SAT |
---|---|
Conference Date | 2003/4/17(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 | Satellite Telecommunications (SAT) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Computer search for best convoluitonal codes |
Sub Title (in English) | |
Keyword(1) | convolutional code |
Keyword(2) | best code |
Keyword(3) | computer search |
Keyword(4) | weight spectraum |
1st Author's Name | Hiroshi SASANO |
1st Author's Affiliation | School of Science and Engineering, Kinki University() |
Date | 2003/4/17 |
Paper # | SAT2003-6,A・P2003-6 |
Volume (vol) | vol.103 |
Number (no) | 23 |
Page | pp.pp.- |
#Pages | 5 |
Date of Issue |