Please use this identifier to cite or link to this item:
Type: Relatório
Title: Parity codes
Author(s)/Inventor(s): Pinto, Paulo Eustáquio Duarte
Protti, Fabio
Szwarcfiter, Jayme Luiz
Abstract: Motivated by a problem posed by Hamming in 1980, we define even codes. They are Huffman type prefix codes with the additional property of being able to detect the occurrence of an odd number of 1 bit errors i the message. We characterize optimal even codes and describe a simple method for constructing the optimal codes. Further, we compare optimal even codes with Huffman codes for equal frequencies. We show thet the maximum encoding in an optmal even code is at most two bits larger than the maximum encoding. in a Hauffman tree. Moreover, it is always possible to choose an optimal even code such that this difference drops to 1 bit. Finally, we compare average sizes. We show that the average size of an encoding in a optimal even tree is at least 1/3 and at most 1/2 of a bit larger than that of a Huffman tree. These values represent the overhead in the encoding sizes for having the hability to detect an odd number of errors in the message.
Keywords: Códigos de paridade
Production unit: Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais
In: Relatório Técnico NCE
Issue: 0104
Issue Date: 31-Dec-2004
Publisher country: Brasil
Language: eng
Right access: Acesso Aberto
Citation: PINTO, P. E. D. ; PROTTI, F. ; SZWARCFITER, J. L. Parity Codes. Rio de Janeiro: NCE, UFRJ, 2004. 15 p. (Relatório Técnico, 01/04)
Appears in Collections:Relatórios

Files in This Item:
File Description SizeFormat 
01_04_000622297.pdf238.51 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.