학술논문
On multiple burst-correcting shortened cyclic codes
Document Type
Conference
Author
Source
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Information theory Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on. :182 2004
Subject
Language
Abstract
In this paper, the multiple burst-correcting shortened cyclic codes are proposed which is optimal in terms of redundancy. We consider linear binary codes and Reed-Solomon codes for correcting shortened cyclic codes.