A Good Method of Combining Codes

Journal Article (Journal Article)

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.

Full Text

Duke Authors

Cited Authors

  • Calderbank, R

Published Date

  • January 1, 1980

Published In

Volume / Issue

  • 32 /

Start / End Page

  • 115 - 124

International Standard Serial Number (ISSN)

  • 0024-3795

Digital Object Identifier (DOI)

  • 10.1016/0024-3795(80)90011-7

Citation Source

  • Scopus