A Tree Based Algorithm for Generating All Possible Binary Compact Codes with N Codewords(Source Cording/Image Processing)(<Special Section>Information Theory and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• A source code for N symbols can be represented by a codeword length sequence (l_1, l_2, , l_N). A binary code is compact if it satisfiesΣ^N_<j=1>2^<-l_3>=1 Also we may assume that 1≤l_1≤l_2≤ ・ ≤l_N. In this paper, we show that these two constraints can be replaced by max{l_<ι-1>≤log2/(1-Σ^<ι-1>_<j=1>2^<-l_3>)≤}≤l_ιle;≤log(N-ι+1)/(1-Σ^<ι-1>_<j=1>2^<-l_3>)≤for 1≤ι≤N-1. Using the latter characterization, we construct a tree T^N representing all binary compact codes In fact every leaf of T^N represents a compact code and vice versa. This technique can also be used to generate all compact codes for a given (l_1, l_2, ・・・, l_κ), κ<N

• 社団法人電子情報通信学会の論文
• 2003-10-01

著者

• T. Gulliver

  The Department Of Electrical & Computer Engineering University Of Victoria

• KHOSRAVIFARD Mohammadali

  the Department of Electrical & Computer Engineering, Isfahan University of Technology

• ESMAEILI Morteza

  the Department of Mathematical Sciences, Isfahan University of Technology

• SAIDI Hossein

  the Department of Electrical & Computer Engineering, Isfahan University of Technology

• Saidi Hossein

  The Department Of Electrical & Computer Engineering Isfahan University Of Technology

• Esmaeili Morteza

  The Department Of Mathematical Sciences Isfahan University Of Technology

• Khosravifard Mohammadali

  The Department Of Electrical & Computer Engineering Isfahan University Of Technology

関連論文

• A Fuzzy-Hierarchical Algorithm for Proportionally-Fair Rate Allocation to Elastic Users(Network)
• A Tree Based Algorithm for Generating All Possible Binary Compact Codes with N Codewords(Source Cording/Image Processing)(Information Theory and Its Applications)

スポンサーリンク