When Huffman Meets Hamming: A Class of Optimal Variable-Length Error Correcting Codes Conference Paper

abstract

• We introduce a family of binary prefix condition codes in which each codeword is required to have a Hamming weight which is a multiple of w for some integer w 2. Such codes have intrinsic error resilience and are a special case of codes with codewords constrained to belong to a language accepted by a deterministic finite automaton. For a given source over n symbols and parameter w we offer an algorithm to construct a minimum-redundancy code among this class of prefix condition codes which has a running time of O(nw+2). 2010 IEEE.

name of conference

• 2010 Data Compression Conference

authors

• Savari, Serap

published proceedings

• 2010 DATA COMPRESSION CONFERENCE (DCC 2010)

author list (cited authors)

• Savari, S. A., & Kliewer, J.

citation count

• 2

complete list of authors

• Savari, Serap A||Kliewer, Jorg

editor list (cited editors)

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

publication date

• January 2010

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Data Compression Conference Proceedings  Journal

keywords

• 46 Information And Computing Sciences
• 49 Mathematical Sciences
• 4901 Applied Mathematics
• 4904 Pure Mathematics

Digital Object Identifier (DOI)

• 10.1109/DCC.2010.35

International Standard Book Number (ISBN) 13

• 9780769539942

start page

• 327

end page

• 336

URL

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