论文信息 - Character sums and MacWilliams identities

Character sums and MacWilliams identities

We show that certain character sums are intimately connected with MacWilliams identities for linear poset codes as well as usual linear codes. We also illustrate in some two poset codes that this method gives much shorter proofs than the ones using discrete Poisson summation formula.

Dae San Kim | Dong Chan Kim

[1] J. H. van Lint,et al. Introduction to Coding Theory , 1982 .

[2] J. H. van Lint,et al. Introduction to Coding Theory , 1982 .

[3] Jeh Gwon Lee,et al. A MacWilliams-type identity for linear codes on weak order , 2003, Discret. Math..

[4] Richard A. Brualdi,et al. Codes with a poset metric , 1995, Discret. Math..

[5] Jeanam Park,et al. On a MacWilliams type identity and a perfectness for a binary linear (n, n-1, j)-poset code , 2003, Discret. Math..