Trellis-Coded Quantization Based on Maximum-Hamming-Distance Binary Codes

Simple item page
dc.creatorCappellari, Lorenzo
dc.date2007-04-11
dc.date2007-12-20
dc.date.accessioned2026-07-07T08:50:11Z
dc.date.available2026-07-07T08:50:11Z
dc.descriptionMost design approaches for trellis-coded quantization take advantage of the duality of trellis-coded quantization with trellis-coded modulation, and use the same empirically-found convolutional codes to label the trellis branches. This letter presents an alternative approach that instead takes advantage of maximum-Hamming-distance convolutional codes. The proposed source codes are shown to be competitive with the best in the literature for the same computational complexity.
dc.description4 pages, 4 graphic files (2 figures using subfigures), LaTeX; minor revisions; submitted to IEEE Trans. Commun
dc.identifierhttps://arxiv.org/abs/0704.1411
dc.identifierhttp://arxiv.org/abs/0704.1411
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144525
dc.subjectInformation Theory
dc.titleTrellis-Coded Quantization Based on Maximum-Hamming-Distance Binary Codes
dc.typetext

Files

Collections

arXiv