Abstract
This paper shows the connection between the combinatorial structure of two dimensional metrics over finite fields ( Shortly, Mannheim and Hexagonal metrics) and some group actions defined over them. We follow the well known approach of P. Delsarte [9] to this problem through the construction of association schemes. Association schemes based on this distances are the basic tools we propose to deal with the metric properties of codes defined over two dimensional metrics and their parameters. We note that some examples of cyclotomic association schemes (which we call M schemes and H schemes respectively) fit properly as weakly metric schemes for these metrics.
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
J.L. Alperin, R.B. Bell, Groups and representations, Graduate Text in Mathematics 162, Springer Verlag (1995).
E. Bannai, T. ItoAlgebraic combinatorics I: Association Schemes Benjamin Cummimgs Publishers (1983)
N. Biggs, Algebraic Graph theory, 2nd. Edition, Cambridge University Press (1993).
B. Bollobás, Modern graph theory, Graduate text in Mathematics. Springer. New York (1998).
P. Camion, Codes and Association Schemes: Basic Properties of Association Schemes Relevant to Coding, in “Handbook of Coding Theory vol 2”, pp. 1441–1566, Ed. V.S. Pless, W.C. Huffman, North-Holland 1999
Hardy, G.H., Wright, E.M.And introduction to the theory of numbers. Oxford Science Publications. 5th. Edition. (1979)
K. Huber, Codes over Gaussian integers., IEEE Trans. on Inf. Theory, 40(1), 207–216 (1994).
K. Huber, The Mac Williams Theorem for Two-dimensional modulo metrics., AAECC, 8(1), 41–48 (1997).
P. Delsarte, An algebraic approach to the association schemes of coding theory., Technical report, Philips Research Laboratory, 1973
P. Delsarte, V.I. Levenshtein, Association schemes and coding theory., IEEE Trans. on Inf. Theory, vol. 44, 6, pp.2477–2504. October 1998
W. Ledermann, Introduction to group characters., Cambridge University Press, 1986
H. Lehmann, Ein vereinheitlichender Ansatz für die Redfield-Polya-de Bruijnsche Abzähltheory., PhD. Thesis Universität Giessen, 1976
E. Martínez, F.J. Galán: Combinatorial structure of arithmetic codes., Winter School on Coding and Information Theory 1998 (Ebeltoft, Denmark)
E. Martínez, M.A. Borges, M. Borges: Combinatorial structure of rings of complex integers with Mannheim metric., 1st. Workshop on Combinatorics, Geometry, Coding Theory and related areas. CIMAF’99 La Habana, Cuba, March 1999.
E. Martínez: Computations on character tables of association schemes., Computer Algebra in Scientific Computing 99, pp. 293–307, Springer-Verlag, 1999.
H. Tarnanen, On Abelian Schemes, TUCKS Technical Report no. 88. Turku Centre for Computer Science 1996
P. Solé, On the parameters of codes for the Lee and modular distance., Discrete Mathematics 89 (1991), pp. 185–194.
P. Solé, A Lloyd theorem in weakly metric association schemes., Europ. J. of Combinatorics. 10 189–196 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martínez-Moro, E., JavierGalán-Simón, F., Borges-Trenard, M., Borges-Quintana, M. (1999). Combinatorial Structure of Finite Fields with Two Dimensional Modulo Metrics⋆. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_4
Download citation
DOI: https://doi.org/10.1007/3-540-46665-7_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66887-9
Online ISBN: 978-3-540-46665-9
eBook Packages: Springer Book Archive