Abstract
In this paper, a construction of one-point Klein codes over finite field \(F_q\) with \(q\) a prime power is illustrated. A lot more good one-point Klein codes can be found than good three-point Klein codes in the literature. Many one-point Klein codes over \(F_q\) are near-MDS long codes. Instead of using automorphisms to facilitate the decoding of the Klein codes, automorphisms are used to derive a systematic encoding for the Klein codes via Gröbner bases. This systematic encoding promises an efficient serial-in-serial-out hardware architecture for the encoder with considerably less complexity than the brute-force one.
Similar content being viewed by others
References
Adams W.W., Loustaunau P.: An Introduction to Gröbner Bases. American Mathematical Soceity, Providence (1994).
Chen J.-P., Lu C.-C.: A serial-in-serial-out hardware architecture for systematic encoding of Hermitian codes via Gröbner bases. IEEE Trans. Commun. 52, 1322–1332 (2004).
Grassl M.: Bounds on the minimum distance of linear codes. http://www.codetables.de. Accessed 20 Oct 2012.
Hansen J.P.: Codes on the Klein quartic, ideals, and decoding. IEEE Trans. Inf. Theory 33, 923–925 (1987).
Heegard C., Little J., Saints K.: Systematic encoding via Gröbner bases for a class of algebraic-geometric Goppa codes. IEEE Trans. Inf. Theory 41, 1752–1761 (1995).
Serre J.P.: Sur le nombre de points rationnels d’une courbe algêbraique sur un corps fini. C. R. Acad. Sci. 296, 397–402 (1983).
Stichtenoth H.: Algebraic Function Fields and Codes. Springer, Berlin (1993).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by G. Korchmaros.
Rights and permissions
About this article
Cite this article
Yang, CY., Lu, CC. One-point Klein codes and their serial-in-serial-out systematic encoding. Des. Codes Cryptogr. 75, 187–197 (2015). https://doi.org/10.1007/s10623-013-9898-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-013-9898-0