| Co-Investigator(Kenkyū-buntansha) |
KURIKI Shinji Osaka Prefecture Univ. Assistant Professor, 工学部, 助教授 (00167389)
FUJI-HARA Roh Tykuba Univ. Professor, 社会工学系, 教授 (30165443)
ISHIHARA Kazuo Osaka Women's Univ. Professor, 理学部, 教授 (90090563)
WATAMORI Yoko Osaka Women's Univ. Assistant Professor, 理学部, 助教授 (70240538)
MARUTA Tatsuya Aichi Prefecture Univ. Assistant Professor, 情報科学部, 助教授 (80239152)
大内 本夫 大阪女子大学, 理学部, 教授 (70127885)
|
|---|
| Budget Amount *help |
¥1,800,000 (Direct Cost: ¥1,800,000)
Fiscal Year 2002: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 2001: ¥1,000,000 (Direct Cost: ¥1,000,000)
|
|---|
| Research Abstract |
The purpose of information theory and coding theory is to investigate the method of coding and encoding from a software point of view such that the transmission is more efficient and more reliable when messages are sent through a given communication channel. When messages are sent through a noisiless channel, the method of most efficient coding has been found by Shannon, Haffman and etc. Hence we consider a noisy q-ary symmetric memoryless channel as a communication channel and consider a linear code as the methord of coding. It is well known that in order to obtain a q-ary linear code which is capable of correcting most errors, it is sufficient to find a q-ary [n,k,d] code such that n=n, (k, d) for all integers k, d, q when messages are sent over a q-ary symmetric memoryless channel with q input and q outputs, where n, (k,d) denotes the smallest value of n for which there exists a q-ary [n,k,d] code. We investigated whether or not there exists a q-ary [n,k,d] code meeting the Griesmer bound for many integers k, d, q. In detail, see "N. Hamada and T. Maruta, A Survey of Recent Results on Optimal Linear Codes and Minihypers, submitted to Discrete Mathematics".
|
