Presentation 2007-07-19
Considerations of the method to construct code with synchronizing codewords
Sumikazu ONO, Hiroshi OKAMOTO, Hajime JINUSHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) There are Huffman equivalent codes which have same average codeword length of Huffman codes. Some of these codes may contain a synchronizing codeword which resynchronizes the code whenever it is transmitted. Escott et al. show construction method of Huffman equivalent codes whose shortest codeword has length m≧2 and which contain a synchronizing codeword of length m+1. In this paper, we will show constractions of codes with more synchronizing codewords such as 010,0110,… and construction of codes with more "forced codeword" whose suffix is synchronizing codeword.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Huffman equivalent code / Synchronizing codeword / Initial synchronizing codeword / forced codeword
Paper # IT2007-9
Date of Issue

Conference Information
Committee IT
Conference Date 2007/7/12(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) Considerations of the method to construct code with synchronizing codewords
Sub Title (in English)
Keyword(1) Huffman equivalent code
Keyword(2) Synchronizing codeword
Keyword(3) Initial synchronizing codeword
Keyword(4) forced codeword
1st Author's Name Sumikazu ONO
1st Author's Affiliation Aoyama gakuin graduate school()
2nd Author's Name Hiroshi OKAMOTO
2nd Author's Affiliation Aoyama gakuin graduate school
3rd Author's Name Hajime JINUSHI
3rd Author's Affiliation Aoyama gakuin university
Date 2007-07-19
Paper # IT2007-9
Volume (vol) vol.107
Number (no) 142
Page pp.pp.-
#Pages 6
Date of Issue