Presentation 1994/7/23
Bounds for Multiple-Burst-Error-Correcting Codes
Mitsuru Hamada,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper provides a lower bound on the number of codewords of the most efficient multiple-burst-error-correcting codes,given error correcting capabilities and lengths of the codes.The bound is a generalization of the Varsharmov-Gilbert bound.This paper introduces upper bounds derived by Hamada and also reveals how these three bounds behave as their code lengths approach infinity. Finally,asymptotic properties of interleaved codes are investigated.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) error-correcting code / multiple-burst-error / bound on rate / asymptotic bound / interleave
Paper # IT94-37
Date of Issue

Conference Information
Committee IT
Conference Date 1994/7/23(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 ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Bounds for Multiple-Burst-Error-Correcting Codes
Sub Title (in English)
Keyword(1) error-correcting code
Keyword(2) multiple-burst-error
Keyword(3) bound on rate
Keyword(4) asymptotic bound
Keyword(5) interleave
1st Author's Name Mitsuru Hamada
1st Author's Affiliation Department of Mathematical Engineering and Information Physics, Faculty of Engineering,University of Tokyo()
Date 1994/7/23
Paper # IT94-37
Volume (vol) vol.94
Number (no) 171
Page pp.pp.-
#Pages 6
Date of Issue