Weight Distributions of Hamming Codes

Simple item page
dc.creatorKim, Dae San
dc.date2007-10-08
dc.date.accessioned2026-07-07T08:34:42Z
dc.date.available2026-07-07T08:34:42Z
dc.descriptionWe derive a recursive formula determing the weight distribution of the [n=(q^m-1)/(q-1), n-m, 3] Hamming code H(m,q), when (m, q-1)=1. Here q is a prime power. The proof is based on Moisio's idea of using Pless power moment identity together with exponential sum techniques.
dc.identifierhttps://arxiv.org/abs/0710.1467
dc.identifierhttp://arxiv.org/abs/0710.1467
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/139526
dc.subjectInformation Theory
dc.subjectNumber Theory
dc.subject94B05, 11T71, 11T23
dc.titleWeight Distributions of Hamming Codes
dc.typetext

Files

Collections

arXiv