Shortened and punctured codes and the MacWilliams identities Original Research Article

We use shortened and punctured codes to give an elementary proof of a combinatorial identity of Brualdi, Pless, and Beissinger from which the MacWilliams identities follow as special cases. We also give a short, mostly combinatorial proof of one form of the MacWilliam identities for binary codes.