On Minimum-Redundancy Fix-free Codes Conference Paper

abstract

• Fix-free codes are variable length codes in which no codeword is the prefix or suffix of another codeword. They are used in video compression standards because their property of efficient decoding in both the forward and backward directions assists with error resilience. This property also potentially halves the average search time for a string in a compressed file relative to unidirectional variable length codes. Relatively little is known about minimum-redundancy fix-free codes, and we describe some characteristics of and observations about such codes. We introduce a new heuristic to produce fix-free codes which is influenced by these ideas. The design of minimum-redundancy fix-free codes is an example of a constraint processing problem, and we offer the first approach to constructing them and a variation with an additional symmetry requirement. 2009 IEEE.

name of conference

• 2009 Data Compression Conference

authors

• Savari, Serap

published proceedings

• DCC 2009: 2009 DATA COMPRESSION CONFERENCE, PROCEEDINGS

author list (cited authors)

• Savari, S. A.

citation count

• 14

complete list of authors

• Savari, Serap A

editor list (cited editors)

• Storer, J. A., & Marcellin, M. W.

publication date

• March 2008

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Data Compression Conference Proceedings  Journal

keywords

• 40 Engineering
• 4006 Communications Engineering
• 46 Information And Computing Sciences
• Clinical Research

Digital Object Identifier (DOI)

• 10.1109/DCC.2009.39

International Standard Book Number (ISBN) 13

• 978-0-7695-3592-0

start page

• 3

end page

• 12

URL

• http://dx.doi.org/10.1109/dcc.2009.39