Published October 1, 2006
| public
Journal Article
Open
Weights Modulo a Prime Power in Divisible Codes and a Related Bound
- Creators
- Liu, Xiaoyu
Abstract
In this paper, we generalize the theorem given by R. M. Wilson about weights modulo$p^t$in linear codes to a divisible code version. Using a similar idea, we give an upper bound for the dimension of a divisible code by some divisibility property of its weight enumerator modulo$p^e$. We also prove that this bound implies Ward's bound for divisible codes. Moreover, we see that in some cases, our bound gives better results than Ward's bound.
Additional Information
© Copyright 2006 IEEE. Reprinted with permission. Manuscript received August 24, 2005; revised May 29, 2006. [Posted online: 2006-09-25] Communicated by A. Ashikhmin, Associate Editor for Coding Theory. The author thanks R. M. Wilson for his interest and support.Files
LIUieeetit06.pdf
Files
(223.9 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:dff3311d18b414c7183112b70a017220
|
223.9 kB | Preview Download |
Additional details
- Eprint ID
- 5358
- Resolver ID
- CaltechAUTHORS:LIUieeetit06
- Created
-
2006-10-13Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field