@inproceedings{35879170b99949bfa06a31fb5262e3bc,
title = "When Huffman meets Hamming: A class of optimal variable-length error correcting codes",
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).",
author = "Savari, {Serap A.} and J{\"o}rg Kliewer",
year = "2010",
doi = "10.1109/DCC.2010.35",
language = "English (US)",
isbn = "9780769539942",
series = "Data Compression Conference Proceedings",
pages = "327--336",
booktitle = "Proceedings - Data Compression Conference, DCC 2010",
note = "Data Compression Conference, DCC 2010 ; Conference date: 24-03-2010 Through 26-03-2010",
}