On optimal reversible-variable-length codes Conference Paper

abstract

• n honor of the sixtieth anniversary of the Kraft inequality, we present variations motivated by the study of reversible-variable-length codes. Reversible-variable-length codes or fix-free codes are prefix condition codes that are instantaneous when decoded in either the forward and backward direction. They have been investigated for joint source-channel coding and have been applied within the video standards H.263+ and MPEG-4. They are also interesting for problems in information retrieval such as searching for patterns directly in compressed text. We provide a low-complexity heuristic to produce fix-free codes. The design of optimal or minimum-redundancy reversible-variable-length codes has been a longstanding open problem. We offer the first solution both to this problem and to a variation in which all codewords are also required to be palindromes.

name of conference

• 2009 Information Theory and Applications Workshop (ITA)

authors

• Savari, Serap

published proceedings

• 2009 Information Theory and Applications Workshop

author list (cited authors)

• Savari, S. A.

citation count

• 9

complete list of authors

• Savari, SA

publication date

• February 2009

publisher

• IEEE  Publisher

keywords

• Clinical Research

Digital Object Identifier (DOI)

• 10.1109/ita.2009.5044962

International Standard Book Number (ISBN) 13

• 9781424439904

start page

• 311

end page

• 317

URL

• https://ieeexplore.ieee.org/document/5044962