Math @ Duke
|
Publications [#343581] of Robert Calderbank
Papers Published
- Calderbank, R, A Good Method of Combining Codes,
Linear Algebra and Its Applications, vol. 32
(January, 1980),
pp. 115-124 [doi]
(last updated on 2025/02/21)
Abstract: Let q be an odd prime power, and suppose q−1 (mod8), Let C(q) and C(q)∗ be the two extended binary quadratic residue codes (QR codes) of length q+1, and let T(q)={(a+x;b+x;a+b+x):a,b∈C(q),x∈C(q)∗}. We establish a square root bound on the minimum weight in T(q). Since the same type of bound applies to C(q) and C(q)∗, this is a good method of combining codes. © 1980, All rights reserved.
|
|
dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
| |
Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320
|
|