On Isometric Error-Correcting Codes over Finite Fields of Prime Order

Authors

  • T. I. Katsaounis Department of Mathematics, Ohio State University, Mansfield Campus, Mansfield , Ohio

DOI:

https://doi.org/10.26713/jims.v10i1-2.677

Keywords:

Error-correcting code, Isometry, Permutational equivalence, Linear equivalence, Equivalent codes

Abstract

Error-correcting codes obtained from each other via a Hamming distance preserving transformation, called isometry, are equivalent. In this paper, we consider three different isometries which yield permutationally equivalent linear codes, monomially equivalent linear codes, and equivalent nonlinear codes, respectively. For each case, we derive some new necessary and sufficient conditions for equivalence using the concept of weight vector of a code or distance matrix of a code. Results hold for error-correcting codes over a finite field of prime order.

Downloads

Download data is not yet available.

References

A. Betten, M. Braun, H. Fripertinger, A. Kerber, A. Kohnert and A. Wasserman, Errorcorrecting linear codes-classification by isometry and applications, Algorithms and Computation in Mathematics (18), Springer, New York (2006).

K. Bogart, D. Goldberg and J. Gordon, An elementary proof of the MacWilliams theorem on equivalence of codes, Information and Control 37 (1) (1978), 19 – 22.

P.G. Bonneau, Poids et equivalence des codes linaires, Informatique Theorique et Applications 21 (3) (1987), 331 – 339.

C.J. Colbourn and J.H. Dinitz (eds.), The CRC Handbook of Combinatorial Designs. CRC Press Series on Discrete Mathematics and its Applications, Chapman and Hall/CRC Press (2006).

I. Constantinescu and W. Heise, On the concept of code-isomorphy, Journal of Geometry 57 (1996), 63 – 69.

J. Hadamard, Resolution d'une question relative aux determinants, Bulletin des Sciences Mathematiques 17 (1893), 240 – 246.

W.G. Huffman and V. Pless, Fundamentals of Error-correcting Codes, Cambridge University Press, Cambridge, UK (2003).

P. Kaski and P.R.J. Ostergard, Classification Algorithms for Codes and Designs, Algorithms and Computations in Mathematics (15), Springer, New York (2006).

C. Lam, Finding error-correcting codes using computers, in NATO Advanced Study Institute on Information Security and Related Combinatorics: Information Security, Coding Theory and Related Combinatorics, D. Crnkovic' and V. Tonchev (eds.), IOS Press, Amsterdam, 278–284 (2011).

Z. Liu and Z. Sun, On the equivalence of linear codes, Applicable Algebra in Engineering, Communication and Computing 22 (2) (2011), 137 – 145.

F.J. MacWilliams, Combinatorial Problems of Elementary Abellian Groups, Ph.D Dissertation, Radcliffe College, Cambridge, Mass. (1962).

F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North Holland Mathematical Library, New York (1977).

J. Moori, Finite groups, designs and codes, in NATO Advanced Study Institute on Information Security and Related Combinatorics: Information Security, Coding Theory and Related Combinatorics, D. Crnkovic and V. Tonchev (eds.), IOS Press, Amsterdam, 202 – 230 (2011).

W.W. Peterson, Error-Correcting Codes, MIT Press, Cambridge, Mass. (1961).

H.N. Ward aand J.A. Wood, Characters and the equivalence of codes, Journal of Combinatorial Theory, Series A 73 (2) (1996), 348 – 352.

Downloads

Published

2018-04-30
CITATION

How to Cite

Katsaounis, T. I. (2018). On Isometric Error-Correcting Codes over Finite Fields of Prime Order. Journal of Informatics and Mathematical Sciences, 10(1-2), 1–11. https://doi.org/10.26713/jims.v10i1-2.677

Issue

Vol. 10 No. 1-2 (2018)

Section

Research Articles

License

Authors who publish with this journal agree to the following terms:
  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.