A Good Method of Combining Codes
Publication
, Journal Article
Calderbank, R
Published in: Linear Algebra and Its Applications
January 1, 1980
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.
Duke Scholars
Published In
Linear Algebra and Its Applications
DOI
ISSN
0024-3795
Publication Date
January 1, 1980
Volume
32
Start / End Page
115 / 124
Related Subject Headings
- Numerical & Computational Mathematics
- 49 Mathematical sciences
- 40 Engineering
- 09 Engineering
- 08 Information and Computing Sciences
- 01 Mathematical Sciences
Citation
APA
Chicago
ICMJE
MLA
NLM
Calderbank, R. (1980). A Good Method of Combining Codes. Linear Algebra and Its Applications, 32, 115–124. https://doi.org/10.1016/0024-3795(80)90011-7
Calderbank, R. “A Good Method of Combining Codes.” Linear Algebra and Its Applications 32 (January 1, 1980): 115–24. https://doi.org/10.1016/0024-3795(80)90011-7.
Calderbank R. A Good Method of Combining Codes. Linear Algebra and Its Applications. 1980 Jan 1;32:115–24.
Calderbank, R. “A Good Method of Combining Codes.” Linear Algebra and Its Applications, vol. 32, Jan. 1980, pp. 115–24. Scopus, doi:10.1016/0024-3795(80)90011-7.
Calderbank R. A Good Method of Combining Codes. Linear Algebra and Its Applications. 1980 Jan 1;32:115–124.
Published In
Linear Algebra and Its Applications
DOI
ISSN
0024-3795
Publication Date
January 1, 1980
Volume
32
Start / End Page
115 / 124
Related Subject Headings
- Numerical & Computational Mathematics
- 49 Mathematical sciences
- 40 Engineering
- 09 Engineering
- 08 Information and Computing Sciences
- 01 Mathematical Sciences