Skip to main content
Log in

Hexagonal metric for linear codes over a finite field

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

This paper consider Hexagonal-metric codes over certain class of finite fields. The Hexagonal metric as defined by Huber is a non-trivial metric over certain classes of finite fields. Hexagonal-metric codes are applied in coded modulation scheme based on hexagonal-like signal constellations. Since the development of tight bounds for error correcting codes using new distance is a research problem, the purpose of this note is to generalize the Plotkin bound for linear codes over finite fields equipped with the Hexagonal metric. By means of a two-step method, the author presents a geometric method to construct finite signal constellations from quotient lattices associated to the rings of Eisenstein-Jacobi (EJ) integers and their prime ideals and thus naturally label the constellation points by elements of a finite field. The Plotkin bound is derived from simple computing on the geometric figure of a finite field.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. K. Huber, Codes over Gaussian integers, IEEE Trans. Inform. Theory, 1994, 40: 207–216.

    Article  MathSciNet  MATH  Google Scholar 

  2. K. Huber, Codes over Eisenstein-Jacobi integers, AMS, Contemp. Math., 1994, 158: 165–179.

    Google Scholar 

  3. Y. Fan and Y. Gao, Codes over algebraic integer rings of cyclotomic fields, IEEE Transaction on Information Theory, 2003, 50(1): 194–200.

    Article  MathSciNet  Google Scholar 

  4. E. Luczak and A. Rosenfeld, Distance on a hexagonal grid, IEEE Trans. Comput., 1976, C-25: 532–533.

    Article  Google Scholar 

  5. K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory, Springer-Verlag, New York, 1982.

    MATH  Google Scholar 

  6. E. R. Berlekamp, Algebraic Coding Theory, Laguna Hills, CA: Aegean Park, 1984.

    Google Scholar 

  7. J. A. Wood, The structure of linear codes of constant weight, Transactions of the AMS, 2002, 351(3): 1007–1026.

    Article  Google Scholar 

  8. T. Pires da Nóbrega Neto, et al., Lattice constellations and codes from quadratic number fields, IEEE Trans. Inform. Theory, 2001, 47(4): 1514–1527.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ying Gao.

Additional information

This research is supported by 973 project under Grant No. 2007CB807901 and the Fundamental Research Funds for the Central Universities under Grant Nos. YWF-10-02-072 and YWF-10-01-A28.

This paper was recommended for publication by Editor Xiao-Shan GAO.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gao, Y. Hexagonal metric for linear codes over a finite field. J Syst Sci Complex 24, 593–603 (2011). https://doi.org/10.1007/s11424-011-9049-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-011-9049-5

Key words

Navigation