2000 character limit reached
Weight Distributions of Hamming Codes
Published 8 Oct 2007 in cs.IT, math.IT, and math.NT | (0710.1467v1)
Abstract: We derive a recursive formula determing the weight distribution of the [n=(qm-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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.