The Weight Distribution of Quasi-quadratic Residue Codes

@article{Boston2017TheWD,
title={The Weight Distribution of Quasi-quadratic Residue Codes},
author={Nigel Boston and Jing Hao},
year={2017},
volume={12},
pages={363-385}
}
• Published 18 May 2017
• Computer Science
• Adv. Math. Commun.
We investigate a family of codes called quasi-quadratic residue (QQR) codes . We are interested in these codes mainly for two reasons: Firstly, they have close relations with hyperelliptic curves and Goppa's Conjecture, and serve as a strong tool in studying those objects. Secondly, they are very good codes. Computational results show they have large minimum distances when \begin{document}$p\equiv 3 \pmod 8$\end{document} . Our studies focus on the weight distributions of these codes. We will…

References

SHOWING 1-10 OF 23 REFERENCES

• D. Joyner
• Mathematics, Computer Science
Discret. Math. Theor. Comput. Sci.
• 2008
This paper investigates how coding theory bounds give rise to bounds such as the following example: for all sufﬁciently large primes p there exists a subset S ⊂ GF(p) for which the bound |X_S(GF(p))| > 1.39p holds.
• Computer Science
ArXiv
• 2008
It is shown in this paper that, for p=137 A_2m = A_34, the Hamming weight distributions of the binary augmented and extended quadratic residue codes of prime 137 may be obtained with out the need of exhaustive codeword enumeration.
• Mathematics, Computer Science
IEEE Transactions on Information Theory
• 2006
It is argued that by using a slightly more complex group than a cyclic group, namely, the dihedral group, the existence of asymptotically good codes that are invariant under the action of the group on itself can be guaranteed.
• Computer Science
IEEE Transactions on Information Theory
• 2004
We give a lower bound for the minimum distance of double circulant binary quadratic residue codes for primes p/spl equiv//spl plusmn/3(mod8). This bound improves on the square root bound obtained by
• I. Duursma
• Mathematics, Computer Science
Discret. Appl. Math.
• 2001
• M. Karlin
• Computer Science
IEEE Trans. Inf. Theory
• 1969
A new circulant echelon canonical form for the perfect (23,12) Golay code is presented and a definite improvement is obtained on the best previously known Bose-Chaudhuri-Hocquenghem cyclic codes.
• P. Gaborit
• Computer Science
J. Comb. Theory, Ser. A
• 2002
A generalization of the Pless symmetry codes to different fields is presented and it is proven that the automorphism group of some of these codes contains the group PSL2(q).
It is proved that depth-three serially concatenated Turbo codes can be asymptotically good and a sharp O( k−1/2) upper bound on the probability that a random binary string generated according to a k-wise independent probability measure has any given weight is found.
This chapter discusses the many decoding algorithms for codes on curves, as well as the Fourier transform and cyclic codes, and their applications in programming, computer science, and mathematics.
This chapter gives constructions of self-dual codes over any Frobenius ring, and describes linear complementary dual codes and makes a new definition of a broad generalization encompassing both self- dual and linear complementary codes.