Abstract
Hermitian-like codes over GF(4) are introduced. For these Hermitian-like codes, we derive a new lower bound of the minimum distance based on nearly-well-behaving sequences. Applying the new bound, we derive improved Hermitian-like codes. We also prove that the improved Hermitian-like codes over GF(4) exceed the Drinfeld-Vlăduţ bound.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. de Boer, Some numerical results and ideas, unpublished manuscript, 1996.
G.-L. Feng and T.R.N. Rao, A simple approach for construction of algebraic-geometric codes from affine plane curves, IEEE Trans. Inform. Theory, vol. 40, pp. 1003–1012, 1994.
T.R.N. Rao —, Improved geometric Goppa codes, Part I: Basic theory, IEEE Trans. Inform. Theory, vol.41, pp. 1678–1693, 1995.
A. Garcia and H. Stichtenoth, A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vlăduţ bound, Inventiones Math.,, vol. 121, pp. 211–222, 1995.
V.D. Goppa, Rational representation of codes and (L, g)-codes, Problemy Peredachi In-formatsii, vol.7, pp. 223–229, 1971.
—, Codes associated with divisors, Problemy Peredachi Informatsii, vol. 13, pp. 33–39, 1977.
—, Codes on algebraic curves, Soviet Math. Doklady, vol. 24, pp. 75–91, 1981.
—, Algebraic-geometric codes, Math. USSR Izvestiya, vol.21, pp. 75–91, 1983.
F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, Amsterdam: North-Holland 1977.
R. Pellikaan, On the gonality of curves, abundant codes and decoding, in Coding Theory and Algebraic Geometry, H. Stichtenoth and M.A. Tsfasman (Editors), Lect. Notes Math., vol. 1518, pp. 132–145, Berlin: Springer-Verlag 1991.
—, On the existence of order functions, in Proc. 2-nd Conference on Design, Codes and Finite Geometry, Shanghai, China, May 1996.
—, Asymptotically good sequences of curves and codes, in Proc. 34-th Allerton Conf. Comm., Control, and Computing, Monticello, IL., pp. 276–285, October 1996.
M.A. Tsfasman, S.G. Vlăduts, and T. Zink, Modular curves, Shimura curves, and Goppa codes better than the Varshamov-Gilbert bound, Math. Nachrichten, vol. 104, pp. 13–28, 1982.
S.G. Vlăduts, G.L. Katsman, and M.A. Tsfasman, Modular curves and codes with polynomial complexity of construction, Probl. Peredachi Inform., vol. 20, pp. 47–55, 1984.
C. Voss and T. Høholdt, An explicit construction of a sequence of codes attaining the Tsfasman-Vlăduţ-Zink bound, IEEE Trans. Inform. Theory, vol.43, pp. 128–135, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Feng, GL., Rao, T.R.N. (1998). Improved Hermitian-like Codes over GF(4). In: Vardy, A. (eds) Codes, Curves, and Signals. The Springer International Series in Engineering and Computer Science, vol 485. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5121-8_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5121-8_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7330-8
Online ISBN: 978-1-4615-5121-8
eBook Packages: Springer Book Archive