Long Quadratic Residue Codes


A long standing problem has been to develop “good” binary linear block codes, C, to be used for error-correction. The length of the block is denoted n and the dimension of the code is denoted k. So in this notation C ⊆ GF (2) is a k-dimensional subspace. Another important parameter is the smallest weight of any non-zero codeword, d. This is related to error… (More)


1 Figure or Table

Cite this paper

@inproceedings{Coy2006LongQR, title={Long Quadratic Residue Codes}, author={Greg Coy}, year={2006} }