Published September 1, 1993
| Version public
Journal Article
Open
Constructions of skew-tolerant and skew-detecting codes
Abstract
The paradigm of skew-tolerant parallel asynchronous communication was introduced by Blaum and Bruck (see ibid., vol. 39, 1993) along with constructions for codes that can tolerate or detect skew. Some of these constructions were improved by Khachatrian (1991). In this paper these constructions are improved upon further, and the authors prove that the new constructions are, in a certain sense, optimal.
Additional Information
© Copyright 1993 IEEE. Reprinted with permission. Manuscript received June 18, 1992; revised January 12, 1993. We are indebted to S. Wuytack for observations that allowed to improve the third tail in Constructions 2.3 and 2.4. Many useful suggestions were provided by the referees.Files
BLAieeetit93b.pdf
Files
(665.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:ab39a5a0ea6e55ae576c0a7bc4acb24b
|
665.7 kB | Preview Download |
Additional details
Identifiers
- Eprint ID
- 9156
- Resolver ID
- CaltechAUTHORS:BLAieeetit93b
Dates
- Created
-
2007-11-04Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field