Published November 1986
| Published
Journal Article
Open
On the existence of optimum cyclic burst-correcting codes
Abstract
It is shown that for each integer b >= 1 infinitely many optimum cyclic b-burst-correcting codes exist, i.e., codes whose length n, redundancy r, and burst-correcting capability b, satisfy n = 2^{r-b+1} - 1. Some optimum codes for b = 3, 4, and 5 are also studied in detail.
Additional Information
© 1986 IEEE. Reprinted with permission. Manuscript received August 28, 1985; revised January 27, 1986. This work was supported in part by the Defense Advanced Research Projects Agency under ARPA order 3771 and in part by the Office of Naval Research under Contract N00014-79-C-0597. This paper was presented at the IEEE International Symposium on Information Theory, Ann Arbor, MI, October 1986.Attached Files
Published - ABDieeetit86.pdf
Files
ABDieeetit86.pdf
Files
(1.3 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:a76ea668382f1d3a0ae2940e306f203b
|
1.3 MB | Preview Download |
Additional details
- Eprint ID
- 2953
- Resolver ID
- CaltechAUTHORS:ABDieeetit86
- 3771
- Advanced Research Projects Agency (ARPA)
- N00014-79-C-0597
- Office of Naval Research (ONR)
- Created
-
2006-05-08Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field