A Tree Based Algorithm for Generating All Possible Binary Compact Codes with <I>N</I> Codewords

Mohammadali KHOSRAVIFARD; Morteza ESMAEILI; Hossein SAIDI; T.  Aaron GULLIVER

A Tree Based Algorithm for Generating All Possible Binary Compact Codes with N Codewords

Mohammadali KHOSRAVIFARD, Morteza ESMAEILI, Hossein SAIDI, T. Aaron GULLIVER

Full Text Views

0

Cite this

Summary :

A source code for N symbols can be represented by a codeword length sequence (₁,₂,,_N). A binary code is compact if it satisfies = 1. Also we may assume that 1 ₁ ₂ _N. In this paper, we show that these two constraints can be replaced by max _i for 1 i 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 (₁,₂,,_k), k < N.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.10 pp.2510-2516

Publication Date: 2003/10/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)

Category: Source Coding/Image Processing

Cite this

Copy

Mohammadali KHOSRAVIFARD, Morteza ESMAEILI, Hossein SAIDI, T. Aaron GULLIVER, "A Tree Based Algorithm for Generating All Possible Binary Compact Codes with N Codewords" in IEICE TRANSACTIONS on Fundamentals, vol. E86-A, no. 10, pp. 2510-2516, October 2003, doi: .
Abstract: A source code for N symbols can be represented by a codeword length sequence (₁,₂,,_N). A binary code is compact if it satisfies = 1. Also we may assume that 1 ₁ ₂ _N. In this paper, we show that these two constraints can be replaced by max _i for 1 i 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 (₁,₂,,_k), k < N.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e86-a_10_2510/_p

Copy

@ARTICLE{e86-a_10_2510,
author={Mohammadali KHOSRAVIFARD, Morteza ESMAEILI, Hossein SAIDI, T. Aaron GULLIVER, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Tree Based Algorithm for Generating All Possible Binary Compact Codes with N Codewords},
year={2003},
volume={E86-A},
number={10},
pages={2510-2516},
abstract={A source code for N symbols can be represented by a codeword length sequence (₁,₂,,_N). A binary code is compact if it satisfies = 1. Also we may assume that 1 ₁ ₂ _N. In this paper, we show that these two constraints can be replaced by max _i for 1 i 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 (₁,₂,,_k), k < N.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - A Tree Based Algorithm for Generating All Possible Binary Compact Codes with N Codewords
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2510
EP - 2516
AU - Mohammadali KHOSRAVIFARD
AU - Morteza ESMAEILI
AU - Hossein SAIDI
AU - T. Aaron GULLIVER
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2003
AB - A source code for N symbols can be represented by a codeword length sequence (₁,₂,,_N). A binary code is compact if it satisfies = 1. Also we may assume that 1 ₁ ₂ _N. In this paper, we show that these two constraints can be replaced by max _i for 1 i 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 (₁,₂,,_k), k < N.
ER -