Presentation 1993/7/8
Performance of Super-imposed Codes for High Rates
Masao Kasahara, Hiroyuki Inaba,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper,we discuss the superimposed codes and the performances.We first introduce the recent work due to Kasahara and Hirasawa and also the work due to Kasahara.We then present the superimposed codes C_(m,k)> for high rates.We discuss the asymptotic performance of the codes C_(m,k)> and show that the codes C_(m,k)> with a simple decoding algorithm are superior to the codes,with bounded distance decoding,that meet the Varsharmov- Gilbert bound.We finally present several example of codes C_(m, k)>.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Super-imposed coding / Decoding algorithm / Varsharmov-Gilbert bound / Asymptotic Performance
Paper # IT93-26
Date of Issue

Conference Information
Committee IT
Conference Date 1993/7/8(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 JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Performance of Super-imposed Codes for High Rates
Sub Title (in English)
Keyword(1) Super-imposed coding
Keyword(2) Decoding algorithm
Keyword(3) Varsharmov-Gilbert bound
Keyword(4) Asymptotic Performance
1st Author's Name Masao Kasahara
1st Author's Affiliation Kyoto Institute of Technology()
2nd Author's Name Hiroyuki Inaba
2nd Author's Affiliation Kyoto Institute of Technology
Date 1993/7/8
Paper # IT93-26
Volume (vol) vol.93
Number (no) 128
Page pp.pp.-
#Pages 6
Date of Issue